Computer Science – Logic in Computer Science
Scientific paper
2004-10-20
Computer Science
Logic in Computer Science
8 pages; C++ Simulator has been developed
Scientific paper
A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite tapes (Master Tape, Synchro Tape, Backup Tape, Backup Synchro Tape, User Tape) and four controlling components (Program, Daemon, Apparatus, User). Computational process consists of three phases (Program Phase, Failure Phase, Repair Phase). C++ Simulator of a Turing machine with faults, failures and recovery has been developed.
No associations
LandOfFree
Turing Machine with Faults, Failures and Recovery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Turing Machine with Faults, Failures and Recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turing Machine with Faults, Failures and Recovery will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-536653