Published by the Department of Computer Science, The University of Chicago.
Computer Science Department
gacs AT bu.edu
We consider computations of a Turing machine under noise that causes violations of the transition function. Given an upper bound \( \beta \) on the size of bursts of faults, we construct a Turing machine \( M(\beta) \) subject to faults that can simulate any fault-free machine under the condition that the time between bursts is lowerbounded by \( O(\beta^2) \).
Submitted April 7, 2012, revised March 2, 2013, published March 27, 2013.