Turing Machine with Faults, Failures and Recovery
Logic in Computer Science
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.cs/0410051,
title = {Turing Machine with Faults, Failures and Recovery},
author = {Alex Vinokur},
journal= {arXiv preprint arXiv:cs/0410051},
year = {2007}
}
Comments
8 pages; C++ Simulator has been developed