The interactive nature of computing: Refuting the strong Church-Turing Thesis

Minds and Machines

Volumn 18, Issue 1, 2008, Pages 17-38

  Goldin, Dina ^a   Wegner, Peter ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Church Turing Thesis; Computation expressiveness; Interactive computation; Paradigm shift; Persistent Turing Machines; Sequential Interaction Thesis; Strong Church Turing Thesis; Turing Machines

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; TURING MACHINES;

CHURCH-TURING THESIS; COMPUTATION EXPRESSIVENESS; INTERACTIVE COMPUTATION; SEQUENTIAL INTERACTION THESIS; STRONG CHURCH-TURING THESIS;

COMPUTATION THEORY;

EID: 38549158847     PISSN: 09246495     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11023-007-9083-1     Document Type: Article

References (34)

1. ACM Curriculum Committee on Computer Science. (1965). An undergraduate program in computer science-preliminary recommendations. Communications of the ACM, 8(9), 543-552.
2. ACM Curriculum Committee on Computer Science. (1969). Curriculum 68: Recommendations for academic programs in computer science. Communications of the ACM, 11(3), 151-197.
3. Brooks, R. (1991). Intelligence without reason. Technical Report 1293. MIT Artificial Intelligence Lab. Cambridge, MA.
4. Cleland, E. C. (2004). The concept of computability. Theoretical Computer Science, 317(1-3), 209-225.
5. Cleland, E. C. (2007). In A. Olszewski (Eds.), The Church-Turing Thesis: A last vestige of a failed mathematical program (pp. 119-149).
6. Copeland, B. J. (1997). The Church-Turing Thesis. Stanford Encyclopedia of Philosophy (substantially revised in 2005).
7. Copeland, B. J. (2002). Hypercomputation. Minds and Machines, 12(4), 461-502.
8. Davis, M. (1958). Computability & unsolvability. McGraw-Hill.
9. Denning, P. (2004). The field of programmers myth. Communications of the ACM, 47(7).
10. Dijkstra, E. W. (1968). Go to statement considered harmful. Communications of the ACM, 11(3), 147-148.
11. Eberbach, E., Goldin, D., & Wegner, P. (2004). Turing's ideas and models of computation. In C. Teuscher (Ed.), Alan turing: Life and legacy of a great thinker. Springer.
12. Fischer, M. J., & Stockmeyer, L. J. (1974). Fast on-line integer multiplication. Journal of Computer and System Sciences, 9(3), 317-331.
13. Fitz, H. (2007). In A. Olszewski, et al. (Eds.), Church's thesis and physical computation (pp. 175-219).
14. Goldin, D., Smolka, S., Attie, P., & Sonderegger, E. (2004). Turing Machines, transition systems, and interaction. Information & Computation Journal, 194(2), 101-128.
15. Goldin, D., & Wegner, P. (2005). The Church-Turing Thesis: Breaking the myth. LNCS 3526 (pp. 152-168). Springer.
16. Goldwasser, S., Micali, S., & Rackoff, C. (1989). The knowledge complexity of interactive proof systems. SIAM Journal of Computing, 18(1), 186-208.
17. Hopcroft, J. E., & Ullman, J. D. (1969). Formal languages and their relation to automata. Addison-Wesley.
18. Knuth, D. (1968). The art of computer programming, Vol. 1: Fundamental algorithms. Addison-Wesley.
19. Kugel, P. (2002). Computing machines can't be intelligent (.and Turing said so). Minds and Machines, 12(4), 563-579.
20. Lynch, N. A., & Tuttle M. R. (1989). An introduction to input/output automata. CWI Quarterly, 2(3), 219-246. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands.
21. Olszewski, A., & Wolenski, J., et. al. (Eds.) (2006). Church's thesis after 70 years. Ontos-Verlag.
22. Papadimitriou, C. H. (1995). Database metatheory: Asking the big queries. In Proceedings of the 14th ACM Symposium on Principles of Database Systems, San Jose, CA.
23. Rice, J. K., & Rice J. R. (1969). Introduction to computer science: Problems, algorithms, languages, information and computers. USA: Holt, Rinehart and Winston.
24. Russell, S., & Norveig, P. (1994). Artificial intelligence: A modern approach. Addison-Wesley.
25. SIGACT News. (2004). ACM Press, p. 49.
26. Sieg, W. (2005). Computability and discrete dynamical systems. LNCS 3526 (pp. 440-440). Springer.
27. Sipser, M. (2005). Introduction to the theory of computation (2nd ed.). PWS Publishing Company.
28. Turing, A. (1936). On computable numbers, with an application to the Entscheidungs problem. Proceedings of the London Mathematical Society, 42(2), 230-265; A correction, ibid, 43, 544-546.
29. van Leeuwen, J., & Wiedermann, J. (2000). The turing machine paradigm in contemporary computing. In B. Enquist & W. Schmidt (Eds.), Mathematics unlimited-2001 and beyond. LNCS. Springer-Verlag.
30. Weger, P. (1968). Programming languages, information structures and machine organization. McGraw-Hill.
31. Wegner, P. (1997). Why interaction is more powerful than algorithms. Communications of the ACM, 40, 80-91.
32. Wegner, P. (1998). Interactive foundations of computing. Theoretical Computer Science, 19(2), 315-351.
33. Wegner, P. (1999). Towards empirical computer science. The Monist, 82(1), 58-108.
34. Wegner, P., & Goldin, D. (2003). Computation beyond Turing Machines. Communications of the ACM, 46, 100-102.