Turing Machine with Faults, Failures and Recovery
Alex Vinokur
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.
Create a lesson
Related papers
Polynomial VASS MDPs
Michal Ajdarow
Proceedings 23rd International Conference on Quantum Physics and Logic
John van de Wetering, Ognyan Oreshkov, Ana Belén Sainz
Final coalgebras over R-modules
Oisín Flynn-Connolly, Henning Basold, Chase Ford
Propositional Dynamic Logic with Program Costs
Krishna Manoorkar, Wolfgang Poiger
Math Foundation Formalization Agent: A General-Purpose Approach to Formalizing Mathematical Foundations
Jiaxin Xie, Guowei Dou, Xiang Ji et al.
Homomorphisms on a product of free convex semilattices
Ana Sokolova, Harald Woracek