The many forms of hypercomputation

Applied Mathematics and Computation

Volumn 178, Issue 1, 2006, Pages 143-153

  Ord, Toby ^a  

^a BALLIOL COLLEGE   (United Kingdom)

Author keywords

Accelerating Turing machine; Hypercomputation; Infinite time Turing machine; Oracles; Randomness

Indexed keywords

COMPUTATION THEORY; RELATIONAL DATABASE SYSTEMS; TURING MACHINES;

ACCELERATING TURING MACHINE; HYPERCOMPUTATION; INFINITE TIME TURING MACHINE; ORACLES; RANDOMNESS;

ELECTRIC MACHINE THEORY;

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

References (45)

1. Blake R.M. The paradox of temporal process. Journal of Philosophy 23 (1926) 645-654
2. Blum L., Shub M., and Smale S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society 21 (1989) 1-46
3. Selmer Bringsjord, A new Gödelian argument for hypercomputing minds based on the busy beaver problem, Applied Mathematics and Computation, in press, doi:10.1016/j.amc.2005.09.071.
4. Church A. An unsolvable problem of elementary number theory. American Journal of Mathematics 58 (1936) 345-363
5. Jack Copeland B. The broad conception of computation. American Behavioral Scientist 40 (1997) 690-716
6. Jack Copeland B. Even Turing machines can compute uncomputable functions. In: Calude C., Casti J., and Dineen M.J. (Eds). Unconventional Models of Computation (1998), Springer-Verlag, Singapore 150-164
7. Jack Copeland B. Turing's o-machines, Penrose, Searle and the brain. Analysis 58 (1998) 128-138
8. Jack Copeland B. Narrow versus wide mechanism. Journal of Philosophy 96 (2000) 5-32
9. Jack Copeland B. Accelerating turing machines. Minds and Machines 12 (2002) 281-301
10. Jack Copeland B. Hypercomputation. Minds and Machines 12 (2002) 461-502
11. Jack Copeland B., and Sylvan R. Beyond the universal turing machine. Australasian Journal of Philosophy 77 (1999) 46-66
12. Brian Davies E. Building infinite machines. British Journal for Philosophy of Science 52 (2001) 671-682
13. Davis M. The myth of hypercomputation. In: Teuscher C. (Ed). Alan Turing: Life and Legacy of a Great Thinker (2004), Springer, Heidelberg 195-212
14. Earman J. Bangs, Crunches, Whimpers and Shrieks-Singularities and Acausalities in Relativistic Spacetimes (1995), Oxford University Press, Oxford
15. Earman J., and Norton J.D. Infinite pains: The trouble with supertasks. In: Morton A., and Stich S.P. (Eds). Benacerraf and his Critics (1996), Blackwell, Cambridge, MA 231-261
16. Etesi G., and Németi I. Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics 41 (2002) 341-370
17. Robin O. Gandy, On the impossibility of using analogue machines to calculate non-computable functions, 1993. Unpublished.
18. Gill J. Computational complexity of probabilistic Turing machines. SIAM Journal of Computing 6 (1977) 675-695
19. Mark Gold E. Limiting recursion. Journal of Symbolic Logic 30 (1965) 28-48
20. Hamkins J.D. Infinite time Turing machines. Minds and Machines 12 (2002) 521-539
21. Hamkins J.D., and Lewis A. Infinite time Turing machines. Journal of Symbolic Logic 65 (1998) 567-604
22. Hogarth M.L. Non-Turing computers and non-Turing computability. PSA 1 (1994) 126-138
23. Rogers Jr. H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill, New York
24. Kelly K.T. The Logic of Reliable Inquiry (1996), Oxford University Press, New York
25. Kieu T.D. Quantum hypercomputation. Minds and Machines 12 (2002) 541-561
26. Kleene S.C. General recursive functions of natural numbers. Mathematishe Annalen 112 (1936) 727-742
27. Kleene S.C. Recursive predicates and quantifiers. Transactions of the American Mathematical Society 53 (1943) 41-73
28. Kugel P. Computing machines can't be intelligent (... and Turing said so). Minds and Machines 12 (2002) 563-579
29. Minsky M. Finite and Infinite Machines (1967), Prentice-Hall, Englewood Cliffs, NJ
30. István Németi, Gyula David, Relativistic beyond Turing computers, Applied Mathematics and Computation, in press.
31. Toby Ord, Hypercomputation: Computing more than the Turing machine. Technical Report arXiv:math.LO/0209332, University of Melbourne, Melbourne, Australia, September 2002. Available at .
32. Toby Ord, Tien D. Kieu, Using biased coins as oracles, 2005. Available at .
33. Putnam H. Trial and error predicates and the solution of a problem of Mostowski. Journal of Symbolic Logic 30 (1965) 49-57
34. Rado T. On non-computable functions. The Bell System Technical Journal 41 (1962) 877-884
35. Russell B.A.W. The limits of empiricism. Proceedings of the Aristotelian Society 36 (1936) 131-150
36. Siegelmann H.T. Neural and super-Turing computing. Minds and Machines 13 1 (2003) 103-114
37. Siegelmann H.T., and Sontag E.D. Analog computation via neural networks. Theoretical Computer Science 131 (1994) 331-360
38. Spaan E., Torenvliet L., and van Emde Boas P. Nondeterminism, fairness and a fundamental analogy. EATCS Bulletin 37 (1989) 186-193
39. Stewart I. Deciding the undecidable. Nature 352 (1991) 664-665
40. Thomson J.F. Tasks and super-tasks. Analysis 15 (1954) 1-13
41. Turing A.M. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1936) 230-265
42. Turing A.M. Systems of logic based on the ordinals. Proceedings of the London Mathematical Society 45 (1939) 161-228
43. Weihrauch K. Computable Analysis (2000), Springer, Berlin
44. Welch P.D. On the possibility, or otherwise, of hypercomputation. British Journal for the Philosophy of Science 55 (2004) 739-746
45. Weyl H. Philosophie der Mathematik and Naturwissenschaft (1927), R. Oldenburg, Munich