Turing's Titanic machine?

Abstract

Embodied and disembodied computing at the Turing Centenary.

References

1. Ambos-Spies, K. and Fejer, P. Degrees of unsolvability. Unpublished, 2006.
2. Andréka, H., Németi, I. and Németi, P. General relativistic hypercomputing and foundation of mathematics. Natural Computing 8, 3 (2009), 499--516.
3. Beggs, E., Costa, J.F. and Tucker, J.V. Limits to measurement in experiments governed by algorithms. Mathematical Structures in Computer Science 20, 6 (2010), 1019--1050.
4. Binder, I., Braverman, M. and Yampolsky, M. Filled Julia sets with empty interior are computable. Foundations of Computational Mathematics 7, 4 (2007), 405--416.
5. Brooks, R. The relationship between matter and life. Nature 409 (2001), 409--411.
6. Brooks, R. The case for embodied intelligence. In Alan Turing---His Work and Impact. S.B. Cooper and J. van Leeuwen, Eds. Elsevier Science, to appear.
7. Calude, C.S. and Svozil, K. Quantum randomness and value indefiniteness. Advanced Science Letters 1 (2008), 165--168.
8. Chaitin, G.J. Metaphysics, metamathematics and metabiology. In Randomness Through Computation: Some Answers, More Questions. H. Zenil, Ed. World Scientific, Singapore, 2011.
9. Cooper, S.B. Emergence as a computability-theoretic phenomenon. Applied Mathematics and Computation 215, 4 (2009), 1351--1360.
10. Cooper, S.B. and Odifreddi, P. Incomputability in nature. In Computability and Models: Perspectives East and West. S.B. Cooper and S.S. Goncharov, Eds. Plenum, New York, 2003, 137--160.
11. Copeland, B.J. Even Turing machines can compute uncomputable functions. In Unconventional Models of Computation. C. Calude, J. Casti, and M. Dinneen, Eds. Springer-Verlag, 1998, 150--164.
12. Costa, J.F., Loff, B. and Mycka, J. A foundations for real recursive function theory. Annals of Pure and Applied Logic 160, 3 (2009), 255--288.
13. Davis, M. The myth of hypercomputation. In Alan Turing: Life and Legacy of a Great Thinker. C. Teuscher, Ed. Springer-Verlag, 2004.
14. Davis, M. Why there is no such discipline as hypercomputation. Applied Mathematics and Computation 178 (2006), 4--7.
15. Deutsch, D. Quantum theory, the Church-Turing principle, and the universal quantum computer. In Proceedings of the Royal Society A400 (1985) 97--117.
16. Hertling, P. Is the Mandelbrot set computable? Math. Logic Quarterly 51 (2005), 5--18.
17. Hodges, A. Alan Turing: The Enigma. Arrow, 1992.
18. Kreisel, G. Church's thesis: A kind of reducibility axiom for constructive mathematics. In Intuitionism and Proof Theory. A. Kino, J. Myhill, and R. E. Vesley, Eds. North-Holland, 1970, 121--150.
19. Leavitt, D. The Man Who Knew Too Much: Alan Turing and the Invention of the Computer. W. W. Norton, 2006.
20. Matiyasevich, Y. Hilbert's Tenth Problem. MIT Press, Cambridge, 1993.
21. Murray, J.D. Mathematical Biology: I. An Introduction. 3^rd Edition. Springer, NY, 2002.
22. Myhill, J. Creative sets. Z. Math. Logik Grundlagen Math. 1 (1955), 97--108.
23. Németi, I. and Dávid, G. Relativistic computers and the Turing barrier. Journal of Applied Mathematics and Computation 178 (2006), 118--142.
24. Odifreddi, P. Little steps for little feet; http://cs.nyu.edu/pipermail/fom/1999-august/003292.html.
25. Pinker, S. How the Mind Works. W.W. Norton, New York, 1997.
26. Pour-El, M.B. and Zhong, N. The wave equation with computable initial data whose unique solution is nowhere computable. Math. Logic Quarterly 43 (1997), 449--509.
27. Prigogine, I. From Being To Becoming. W.H. Freeman, New York, 1980.
28. Prigogine, I. The End of Certainty: Time, Chaos and the New Laws of Nature. Free Press, New York, 1997.
29. Rozenberg, G., Bäck, T.B. and Kok, J.N., Eds. Handbook of Natural Computing. Springer, 2011.
30. Saari, D.G. and Xia, Z.J. Off to infinity in finite time. Notices of the American Mathematical Society 42, 5 (1995), 538--546.
31. Sloman, A. Some requirements for human-like robots: Why the recent over-emphasis on embodiment has held up progress. In Creating Brain-Like Intelligence LNCS 5436. B. Sendhoff et al., Eds. Springer, 2009, 248--277.
32. Smolensky, P. On the proper treatment of connectionism. Behavioral and Brain Sciences 11, 1 (1988), 1--74.
33. Teuscher, C. Turing's Connectionism. An Investigation of Neural Network Architectures. Springer-Verlag, London, 2002.
34. Turing, A.M. On computable numbers with an application to the Entscheidungs problem. In Proceedings London Mathematical Society 42 (1936), 230--265.
35. Turing, A.M. The chemical basis of morphogenesis. Phil. Trans. of the Royal Society of London. Series B, Biological Sciences 237, 641 (1952), 37--72.
36. Velupillai, K.V. Uncomputability and undecidability in economic theory. Applied Mathematics and Computation 215, 4 (Oct. 2009), 1404--1416.
37. Wegner, P. and Goldin, D. The Church-Turing Thesis: Breaking the myth. In CiE: New Computational Paradigms LNCS 3526. S.B. Cooper and B. Löwe, Eds. Springer, 2005.
38. Wiedermann, J. and van Leeuwen, J. How we think of computing today. Logic and Theory of algorithms LNCS 5028. A. Beckmann, C. Dimitracopoulos, and B. Löwe, Eds. Springer-Verlag, Berlin, 2008, 579--593.
39. Yates, C.E.M. On the degrees of index sets. Transactions of the American Mathematical Society 121 (1966), 309--328.
40. Ziegler, M. Physically-relativized Church-Turing Hypotheses. Applied Mathematics and Computation 215, 4 (2009), 1431--1447.

Index Terms

• Computing methodologies

  • Artificial intelligence

    • Knowledge representation and reasoning

  • Symbolic and algebraic manipulation

    • Symbolic and algebraic algorithms

      • Theorem proving algorithms

• Social and professional topics

  • Professional topics

    • Computing education

      • Computing education programs

        • Computer science education

        • Information science education

• Theory of computation

  • Logic

  • Models of computation