The Church-Turing thesis: Still valid after all these years?

Applied Mathematics and Computation

Volumn 178, Issue 1, 2006, Pages 93-102

  Galton, Antony ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

Church Turing thesis; Hypercomputation; Turing machine

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE;

CHURCH-TURING THESIS; HYPERCOMPUTATION;

TURING MACHINES;

EID: 33745506851     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.09.086     Document Type: Article

References (20)

1. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1936) 230-265
2. Church A. An unsolvable problem of elementary number theory. The American Journal of Mathematics 58 (1936) 345-363
3. Galton A. The Church-Turing thesis: its nature and status. In: Millican P., and Clark A. (Eds). The Legacy of Alan Turing. Machines and Thought vol. I (1996), Clarendon Press, Oxford 137-164
4. B. Jack Copeland, The Church-Turing thesis, in: E.N. Zalta (Ed.), Stanford Encyclopedia of Philosophy. August 2002. Available from: .
5. Gandy R. The confluence of ideas in 1936. In: Herken R. (Ed). The Universal Turing Machine: A Half-Century Survey (1988), Oxford University Press, Oxford 55-111
6. Geach P.T. Logic Matters (1972), Basil Blackwell, Oxford
7. Copeland B.J., and Proudfoot D. Alan Turing's forgotten ideas in computer science. Scientific American 280 (1999) 76-81
8. Copeland B.J. Accelerating Turing machines. Minds and Machines 12 (2002) 281-301
9. Thomson J.F. Tasks and super-tasks. Analysis 15 1 (1954) 1-13
10. J.P. Laraudogoitia, Supertasks, in: E.N. Zalta, (Ed.), Stanford Encyclopedia of Philosophy, November 2001. Available from: .
11. Pitowsky I. The physical Church thesis and physical computational complexity. Iyyun 39 (1990) 81-99
12. Hogarth M. Does general relativity allow an observer to view an eternity in a finite time?. Foundations of Physics Letters 5 (1992) 173-181
13. Earman J., and Norton J.D. Forever is a day: supertasks in Pitowsky and Malament-Hogarth spacetimes. Philosophy of Science 60 (1993) 22-42
14. Hogarth M. Non-Turing computers and non-Turing computability. Proceedings of the Philosophy of Science Association (PSA) 1 (1994) 126-138
15. Shagrir O., and Pitowsky I. Physical hypercomputation and the Church-Turing thesis. Minds and Machines 13 (2003) 87-101
16. Siegelmann H.T. Computation beyond the Turing limit. Science 268 (1995) 545-548
17. Davis M. The myth of hypercomputation. In: Teuscher C. (Ed). Alan Turing: Life and Legacy of a Great Thinker (2004), Springer 195-211
18. Moore C. Recursion theory on the reals and continuous-time computation. Theoretical Computer Science 162 (1996) 23-44
19. Deutsch D. Quantum theory, the Church-Turing principle, and the universal quantum computer. Proceedings of the Royal Society, London, A 400 (1985) 97-117
20. Kieu T.D. Quantum hypercomputation. Minds and Machines 12 (2002) 541-561