Turing Machine with Faults, Failures and Recovery
Alex Vinokur
TL;DR
This paper introduces a fault-tolerant Turing machine model with multiple tapes and control components, along with a C++ simulator demonstrating its phases of operation, including failure and recovery.
Contribution
It presents a novel fault-tolerant Turing machine model with detailed phases and a functional simulator, expanding the understanding of reliable computation.
Findings
Developed a detailed TMF model with five tapes and four control components.
Implemented a C++ simulator demonstrating fault, failure, and recovery phases.
Showed the feasibility of fault-tolerant computation in Turing machines.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms