A fault-tolerant turing machine

The Turing machine is the most studied universal model of computation. This thesis studies the question if there is a Turing machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the existence of a Turing machine that—with a polynomial overhead—can simulate any other Turing machine, even when it is subject to faults of the above type, thereby answering the question that was open for 25 years.