Skip to main content
SpringerLink
Log in

A Turing Machine Resisting Isolated Bursts of Faults

  • Conference paper
SOFSEM 2012: Theory and Practice of Computer Science (SOFSEM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7147))

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(β).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asarin, E., Collins, P.: Noisy Turing Machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1031–1042. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Çapuni, I., Gács, P.: A Turing Machine Resisting Isolated Bursts Of Faults, http://cs-people.bu.edu/ilir/ftTM/thePaper.pdf

  3. Kurdyumov, G.L.: An Example of a Nonergodic One-Dimensional Homogoenous Random Medium With Positive Transition Probabilities. Soviet Math. Dokl. 19(1) (1978)

    Google Scholar 

  4. Gács, P.: Reliable Computation with Cellular Automata. Journal of Computer System Science 32(1), 15–78 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gács, P.: Reliable Cellular Automata with Self-organization. In: Proc. of the 37th IEEE FOCS Symposium, pp. 90–99 (1997)

    Google Scholar 

  6. Gács, P., Reif, J.: A simple three-dimensional real-time reliable cellular array. Journal of Computer and System Sciences 36(2), 125–147 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Misra, J., Gries, D.: Finding Repeated Elements. Science of Computer Programming 2, 143–152 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Pippenger, N.: On networks of noisy gates. In: Proc. of the 26th IEEE FOCS Symposium, pp. 30–38 (1985)

    Google Scholar 

  9. Spielman, D.: Highly Fault-tolerant Parallel Computation. In: Proc. of the 37th IEEE FOCS Symposium, pp. 154–163 (1996)

    Google Scholar 

  10. Toom, A.: Stable and Attractive Trajectories in Multicomponent Systems. In: Dobrushin, R.L. (ed.) Multicomponent Systems. Advances in Probability, vol. 6, pp. 549–575. Dekker, New York (1980) (translation from Russian)

    Google Scholar 

  11. von Neumann, J.: Probabilistic Logics And the Synthesis of Reliable Organisms From Unreliable Components. In: Shannon, C., McCarthy (eds.) Automata Studies. Princeton University Press, Princeton (1956)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Boston University, 111 Cummington str, 02215, Boston, USA

    Ilir Çapuni & Peter Gács

Authors
  1. Ilir Çapuni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Gács
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics and Information Technologies, Institute of Informatics and Software Engineering, Slovak University of Technology in Bratislava, Ilkovičova 3, 842 16, Bratislava 4, Slovakia

    Mária Bieliková

  2. Dept. of Intelligent Systems and Business Informatics, Alpen-Adria-Universität Klagenfurt, Universitätsstr. 65-57, 9020, Klagenfurt, Austria

    Gerhard Friedrich

  3. Department of Computer Science, University of Oxford, UK

    Georg Gottlob

  4. Security Engineering Group, Technische Universität Darmstadt, Hochschulstr. 10, 64289, Darmstadt, Germany

    Stefan Katzenbeisser

  5. University of Illinois at Chicago, Dept. of Math., Stat. and Comp. Sci, 851 S. Morgan Street, Chicago, IL 60607-7045, USA; and University of Szeged, Research Group on Artificial Intelligence of the Hungarian Academy of Sciences, 6701 Szeged, Postafiók, Hungary

    György Turán

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Çapuni, I., Gács, P. (2012). A Turing Machine Resisting Isolated Bursts of Faults. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27660-6_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27659-0

  • Online ISBN: 978-3-642-27660-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation