A Turing Machine Resisting Isolated Bursts Of Faults

TL;DR

This paper introduces a fault-tolerant Turing machine model that can simulate any error-free computation despite bursts of faults, provided they are sufficiently spaced apart.

Contribution

It constructs a Turing machine capable of resisting isolated bursts of faults and simulating fault-free computations under bounded burst conditions.

Findings

Successfully simulates fault-free machines with bounded burst faults.

Establishes a relationship between burst size B and the spacing V for fault tolerance.

Provides a construction for a resilient Turing machine M(B).

Abstract

We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound B on the size of bursts of faults, we construct a Turing machine M(B) subject to faults that can simulate any fault-free machine under the condition that bursts are not closer to each other than V for an appropriate V = O(B^2).