Turing Machine with Faults, Failures and Recovery

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
8 pages; C++ Simulator has been developed

Keywords

Logic in Computer Science, F.1.1; F.4.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32380

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0410051
 http://arxiv.org/abs/cs/0410051

Collections

arXiv