Turing Machine with Faults, Failures and Recovery

Simple item page
dc.creatorVinokur, Alex
dc.date2004-10-20
dc.date.accessioned2026-07-07T03:21:53Z
dc.date.available2026-07-07T03:21:53Z
dc.descriptionA 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.
dc.description8 pages; C++ Simulator has been developed
dc.identifierhttps://arxiv.org/abs/cs/0410051
dc.identifierhttp://arxiv.org/abs/cs/0410051
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32380
dc.subjectLogic in Computer Science
dc.subjectF.1.1; F.4.1
dc.titleTuring Machine with Faults, Failures and Recovery
dc.typetext

Files

Collections

arXiv