A turing machine resisting isolated bursts of faults

Authors:
Ilir Çapuni;Peter Gács
Affiliations:
Department of Computer Science, Boston University, Boston;Department of Computer Science, Boston University, Boston
Venue:
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Year:
2012

Citing 6
Cited 0

Reliable computation with cellular automata

Journal of Computer and System Sciences
A simple three-dimensional real-time reliable cellular array

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Reliable cellular automata with self-organization

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Highly fault-tolerant parallel computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On networks of noisy gates

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Noisy turing machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

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 β on the size of bursts of faults, we construct a Turing machine M (β ) subject to faults that can simulate any fault-free machine under the condition that bursts not closer to each other than V for an appropriate V =O (β ).