Skip to main content

The Church-Turing Thesis: Breaking the Myth

  • Conference paper
New Computational Paradigms (CiE 2005)

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

Included in the following conference series:

Abstract

According to the interactive view of computation, communication happens during the computation, not before or after it. This approach, distinct from concurrency theory and the theory of computation, represents a paradigm shift that changes our understanding of what is computation and how it is modeled. Interaction machines extend Turing machines with interaction to capture the behavior of concurrent systems, promising to bridge these two fields. This promise is hindered by the widespread belief, incorrectly known as the Church-Turing thesis, that no model of computation more expressive than Turing machines can exist. Yet Turing’s original thesis only refers to the computation of functions and explicitly excludes other computational paradigms such as interaction. In this paper, we identify and analyze the historical reasons for this widespread belief. Only by accepting that it is false can we begin to properly investigate formal models of interaction machines. We conclude the paper by presenting one such model, Persistent Turing Machines (PTMs). PTMs capture sequential interaction, which is a limited form of concurrency; they allow us to formulate the Sequential Interaction Thesis, going beyond the expressiveness of Turing machines and of the Church-Turing thesis.

We sincerely thank the anonymous reviewers for their comments, which were very helpful in revising this paper.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. An Undergraduate Program in Computer Science-Preliminary Recommendations, A Report from the ACM Curriculum Committee on Computer Science. Comm. ACM 8(9), 543–552 (1965)

    Google Scholar 

  2. Curriculum 68: Recommendations for Academic Programs in Computer Science, A Report of the ACM Curriculum Committee on Computer Science. Comm. ACM 11(3), 151–197 (1968)

    Google Scholar 

  3. Brooks, R.: Intelligence Without Reason. MIT AI Lab Technical Report 1293

    Google Scholar 

  4. Davis, M.: Computability & Unsolvability. McGraw-Hill, New York (1958)

    MATH  Google Scholar 

  5. Denning, P.: The Field of Programmers Myth. Comm. ACM (July 2004)

    Google Scholar 

  6. Eberbach, E., Goldin, D., Wegner, P.: Turing’s Ideas and Models of Computation. In: Teuscher, C. (ed.) Alan Turing: Life and Legacy of a Great Thinker. Springer, Heidelberg (2004)

    Google Scholar 

  7. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comp. 18(1), 186–208 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. Goldin, D., Smolka, S., Attie, P., Sonderegger, E.: Turing Machines, Transition Systems, and Interaction. Information & Computation J. (November 2004)

    Google Scholar 

  9. Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Addison-Wesley, Reading (1969)

    MATH  Google Scholar 

  10. Knuth, D.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison-Wesley, Reading (1968)

    MATH  Google Scholar 

  11. Lynch, N., Tuttle, M.: An Introduction to Input/Output automata. CWI Quarterly 2(3), 219–246 (1989); Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands

    Google Scholar 

  12. Rice, J.K., Rice, J.N.: Computer Science: Problems, Algorithms, Languages, Information and Computers. Holt, Rinehart and Winston (1969)

    Google Scholar 

  13. Russell, S., Norveig, P.: Artificial Intelligence: A Modern Approach. Addison-Wesley, Reading (1994)

    Google Scholar 

  14. Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)

    MATH  Google Scholar 

  15. Sanchis, L.: Recursive Functionals. North-Holland, Amsterdam (1992)

    MATH  Google Scholar 

  16. SIGACT News, p. 49. ACM Press, New York (March 2004)

    Google Scholar 

  17. Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1997)

    Google Scholar 

  18. Turing, A.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc. 42(2), 230–265 (1936); A correction, ibid 43, 544-546 (1937)

    Google Scholar 

  19. van Leeuwen, J., Wiedermann, J.: The Turing Machine Paradigm in Contemporary Computing. In: Enquist, B., Schmidt, W. (eds.) Mathematics Unlimited - 2001 and Beyond. Springer, Heidelberg (2000)

    Google Scholar 

  20. Wegner, P.: Programming Languages, Information Structures and Machine Organization. McGraw-Hill, New York (1968)

    Google Scholar 

  21. Wegner, P.: Why Interaction is More Powerful Than Algorithms. Comm. ACM (May 1997)

    Google Scholar 

  22. Wegner, P.: Interactive Foundations of Computing. Theoretical Computer Science 192 (February 1998)

    Google Scholar 

  23. Wegner, P., Goldin, D.: Computation Beyond Turing Machines. Comm. ACM (April 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldin, D., Wegner, P. (2005). The Church-Turing Thesis: Breaking the Myth. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_20

Download citation

  • DOI: https://doi.org/10.1007/11494645_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26179-7

  • Online ISBN: 978-3-540-32266-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics