The Church-Turing thesis: Breaking the myth

Lecture Notes in Computer Science

Volumn 3526, Issue , 2005, Pages 152-168

  Goldin, Dina ^a   Wegner, Peter ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONCURRENCY CONTROL; MATHEMATICAL MODELS;

CHURCH-TURING THESIS; CONCURRENCY THEORY; INTERACTION MACHINES; SEQUENTIAL INTERACTION THESIS;

TURING MACHINES;

EID: 26444603940     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494645_20     Document Type: Conference Paper

References (23)

1. An Undergraduate Program in Computer Science-Preliminary Recommendations, A Report from the ACM Curriculum Committee on Computer Science. Comm. ACM 8(9), Sep. 1965, pp. 543-552.
2. Curriculum 68: Recommendations for Academic Programs in Computer Science, A Report of the ACM Curriculum Committee on Computer Science. Comm. ACM 11(3), Mar. 1968, pp. 151-197.
3. R. Brooks. Intelligence Without Reason. MIT AI Lab Technical Report 1293.
4. M. Davis. Computability & Unsolvability. McGraw-Hill, 1958.
5. P. Denning. The Field of Programmers Myth. Comm. ACM, July 2004.
6. E. Eberbach, D. Goldin, P. Wegner. Turing's Ideas and Models of Computation. In Alan Turing: Life and Legacy of a Great Thinker, ed. Christof Teuscher, Springer 2004.
7. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comp., 18(1):186-208, 1989.
8. D. Goldin, S. Smolka, P. Attie, E. Sonderegger. Turing Machines, Transition Systems, and Interaction. Information & Computation J., Nov. 2004.
9. J.E. Hopcroft, J.D. Ullman. Formal languages and their relation to automata. Addison-Wesley, 1969.
10. D. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, 1968.
11. N. Lynch, M. Tuttle. An Introduction to Input/Output automata. CWI Quarterly, 2(3):219-246, Sep. 1989. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands.
12. J. K. Rice, J. N. Rice. Computer Science: Problems, Algorithms, Languages, Information and Computers. Holt, Rinehart and Winston, 1969.
13. S. Russell, P. Norveig. Artificial Intelligence: A Modern Approach. Addison-Wesley, 1994.
14. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.
15. L. Sanchis. Recursive Functionals, North Holland, 1992.
16. SIGACT News, ACM Press, March 2004, p. 49.
17. M. Sipser. Introduction to the Theory of Computation, PWS Publishing Company, 1997.
18. A. Turing. On Computable Numbers, with an Application to the Entschei-dungsproblem, Proc. London Math. Soc., 42:2, 1936, pp. 230-265; A correction, ibid, 43, 1937, pp. 544-546.
19. J. van Leeuwen, J. Wiedermann. The Turing Machine Paradigm in Contemporary Computing, in Mathematics Unlimited - 2001 and Beyond, eds. B. Enquist and W. Schmidt, Springer-Verlag, 2000.
20. P. Wegner. Programming Languages, Information Structures and Machine Organization, McGraw-Hill, 1968.
21. P. Wegner. Why Interaction is More Powerful Than Algorithms. Comm. ACM, May 1997.
22. P. Wegner. Interactive Foundations of Computing. Theoretical Computer Science 192, Feb. 1998.
23. P. Wegner, D. Goldin. Computation Beyond Turing Machines. Comm. ACM, Apr. 2003.