Hypercomputation and the physical Church-Turing Thesis

British Journal for the Philosophy of Science

Volumn 54, Issue 2, 2003, Pages 181-223

  Cotogno, Paolo ^a  

^a NONE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2442482760     PISSN: 00070882     EISSN: None     Source Type: Journal    
DOI: 10.1093/bjps/54.2.181     Document Type: Review

References (143)

1. Aczel, P. [1988]: Non-Well-Founded Sets, Stanford, CA: Center for the Study of Language and Information.
2. Aharonov, D. [1998]: 'Quantum Computation', in D. Stauffer (ed.), Annual Reviews of Computational Physics VI, Singapore: World Scientific.
3. Aharonov, Y., Anandan, J., Popescu, S. and Vaidman, L. [1990]: 'Superpositions of time evolutions and a quantum time-translation machine', Physical Review Letters, 64, p. 2965.
4. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P. H., Nicollin, X., Olivero, A., Sifakis, J. and Yovine, S. [1995]: 'The Algorithmic Analysis of Hybrid Systems', Theoretical Computer Science, 138, pp. 3-34.
5. Arntzenius, F. and Maudlin, T. [2000]: Time Travel and Modern Physics', in E. Zalta (ed.), Stanford Encyclopedia of Philosophy, 〈http://plato. stanford.edu/entries/time-travel-phys/〉.
6. Bains, S. and Johnson, J. [2000]: Noise, physics and non-Turing computation, 4th International Joint Conference on Information Systems, Atlantic City, preprint.
7. Bains, S., Johnson, J. and Hall T. [forthcoming]: 'Physical Computation and "Big" Artificial Intelligence'.
8. Banks, T. [1995]: 'Lectures on Black Holes and Information Loss', Nuclear Physics Proceedings, Supplement, 41, pp. 21-65.
9. Battacharya, N., van Linden van den Heuvell, H. B. and Spreeuw, R. J. C. [2002]: 'Implementation of Quantum Search Algorithm using Classical Fourier Optics', Physical Review Letters, 88, 137901.
10. Bekenstein, J. D. [2001]: Buchi neri, comunicazione, energia, Roma: Di Renzo.
11. Bernstein, E. and Vazirani, U. [1997]: 'Quantum complexity theory', SIAM Journal on Computing, 26, pp. 1411-73.
12. Berthiaume, A. [1997]: 'Quantum Computation', in L. A. Hemaspaandra and A. L. Selman (eds), Complexity Theory Retrospective II, New York: Springer, pp. 23-51.
13. Blum, L., Cucker, F., Shub, M. and Smale, S. [1996]: 'Complexity and Real Computation: A Manifesto', International Journal of Bifurcation and Chaos, 6, pp. 3-26.
14. Bournez, O. and Cosnard, M. [1996]: On The Computational Power And Super-Turing Capabilities Of Dynamical Systems, NeuroCOLT Technical Report NC-TR-96-005.
15. Brukner, C., Pan, J.-W., Simon, C., Weihs, G. and Zeilinger, A. [2001]: Probabilistic Instantaneous Quantum Computation, arXiv:quant-ph/0109022, preprint.
16. Burgin, M. [1999]: 'Super-recursive algorithms as a tool for high-performance computing', Proceedings of the High Performance Computing Symposium, San Diego, CA, pp. 224-8.
17. Burgin, M. [2001]: Mathematical Models for Artificial Intelligence, UCLA Department of Mathematics, Los Angeles, preprint.
18. Butterfield, J. and Isham, C. J. [2001]: 'Spacetime and the Philosophical Challenge of Quantum Gravity', in C. Callender and N. Huggett (eds), Physics Meets Philosophy at the Planck Scale, Cambridge: Cambridge University Press.
19. Calude, C., Campbell, D. J., Svozil, K. and Stefanescu, D. [1995]: 'Strong Determinism vs. Computability', in W. Depauli-Schimanovich, E. Koehler and F. Stadler (eds), The Foundational Debate, Complexity and Constructivity in Mathematics and Physics, Dordrecht: Kluwer, pp. 115-31.
20. Calude, C., Dinneen, M. J. and Svozil, K. [1999]: Counterfactual Effect, the Halting Problem, and the Busy Beaver Function, CDMTCS-107, University of Auckland, New Zealand.
21. Calude, C., Dinneen, M. J. and Svozil, K. [2000]: 'Reflections on Quantum Computing', Complexity, 6, pp. 35-7.
22. Calude, C. S. and Pavlov, B. [2002]: Coins, Quantum Measurements, and Turing's Barrier, CDMTCS-170, University of Auckland, New Zealand.
23. Campagnolo, M. L. and Moore, C. [2000]: 'Upper and lower bounds on continuous-time computation', Proceedings of the 2nd International Conference on Unconventional Models of Computation, pp. 135-53.
24. Carlini, A., Frolov, V. P., Mensky, M. B., Novikov, I. D. and Soleng, H. H. [1995]: Time Machines: the Principle of Self-Consistency as a Consequence of the Principle of Minimal Action, NORDITA preprint 95/49.
25. Castagnoli, G. [1998]: An Inherently Quantum Computation Paradigm: NP-complete = P Under the Hypothetical Notion of Continuous Uncomplete von Neumann Measurement, quant-ph 9810017, preprint.
26. Chaitin, G. J. [1975]: 'A theory of program size formally identical to information theory', Journal of the ACM, 22, pp. 329-40.
27. Chaitin, G. J. [1990]: 'Undecidability and Randomness in Pure Mathematics', in Information, Randomness & Incompleteness, Singapore: World Scientific, pp. 307-13.
28. Church, A. [1936]: 'An unsolvable problem of elementary number theory', American Journal of Mathematics, 58, pp. 345-63.
29. Cleland, C. [1993]: 'Is the Church-Turing Thesis True?', Minds and Machines, 3, pp. 283-312.
30. Cleland, C. [2001]: 'Recipes, Algorithms, and Programs', Minds and Machines, 11, pp. 219-37.
31. Cooper, S. B. [1999]: 'Clockwork or Turing U/universe? Remarks on Causal Determinism and Computability', in S. B. Cooper, and J. K. Truss (eds), Models of Computability, Cambridge: Cambridge University Press, pp. 63-116.
32. Copeland, B. J. [1997]: 'The Broad Conception of Computation', American Behavioral Scientist, 40, pp. 690-716.
33. Copeland, B. J. [1998a]: 'Super Turing-Machines', Complexity, 4, pp. 30-2.
34. Copeland, B. J. [1998b]: 'Turing's O-machines, Searle, Penrose, and the Brain', Analysis, 58, pp. 128-38.
35. Copeland, B. J. [1998c]: 'Even Turing Machines Can Compute Uncomputable Functions', in C. S. Calude, J. Casti, M. J. Dinneen (eds), Unconventional Models of Computation, Singapore: Springer, pp. 150-64.
36. Copeland, B. J. [2000]: 'Narrow Versus Wide Mechanism: Including a Re-examination of Turing's Views on the Mind-Machine Issue', The Journal of Philosophy, 96, pp. 5-32.
37. Copeland, B. J., Proudfoot, D. [1999]: 'Alan Turing's Forgotten Ideas in Computer Science', Scientific American, 280, pp. 99-103.
38. Copeland, B. J. and Sylvan, R. [1999]: 'Beyond the Universal Turing Machine', Australasian Journal of Philosophy, 77, pp. 46-66.
39. Cramer, J. G. [1988]: 'An Overview of the Transactional Interpretation', International Journal of Theoretical Physics, 27, p. 227.
40. Davies, E. B. [2001]: 'Building Infinite Machines', British Journal for the Philosophy of Science, 52, pp. 671-82.
41. De Long, H. [1970]: A Profile of Mathematical Logic, Reading, MA: Addison-Wesley.
42. Deutsch, D. [1985]: 'Quantum theory, the Church-Turing principle and the universal quantum computer', Proceedings of the Royal Society, A 400, pp. 97-117.
43. Deutsch, D., Ekert, A. and Lupacchini, R. [2000]: 'Machines, Logic and Quantum Physics', Bulletin of Symbolic Logic, 3, pp. 265-83.
44. Doyle, J. [1982]: What is Church's Thesis?, Laboratory of Computer Science, MIT, Cambridge, MA.
45. Earman, J. [1995]: 'Outlawing Time Machines: Chronology Protection Theorems', British Journal for the Philosophy of Science, 45, pp. 5-19.
46. Earman, J. and Norton, J. D. [1993]: 'Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes', Philosophy of Science, 60, pp. 22-42.
47. Earman, J. and Norton, J. D. [1998]: 'Comments on Laraudogoitia's "Classical Particle Dynamics, Indeterminism and a Supertask", British Journal for the Philosophy of Science, 49, pp. 123-33.
48. Barman, J. and Smeenk, C. [forthcoming]: 'Take a Ride on a Time Machine', in R. Jones, P. Ehrlich (eds), Reverberations of the Shaky Game, Chicago: University of Chicago Press.
49. Ekert, A. and Jozsa, R. [1998]: Quantum Algorithms: Entanglement Enhanced Information Processing, quant-ph 9803072, preprint.
50. Elitzur, A. C. and Dolev, S. [2000]: Black Hole Evaporation Entails an Objective Passage of Time, arXiv:quant-ph/0012081, preprint.
51. Etesi, G. and Németi, I. [2002]: 'Non-Turing computations via Malament-Hogarth space-times', International Journal of Theoretical Physics, 41, pp. 341-70.
52. Feynman, R. P. [1986]: 'Quantum Mechanical Computers', Foundations of Physics, 16, pp. 507-31.
53. Galton, A. [1996]: 'The Church-Turing Thesis: Its Nature and Status', in P. J. R. Millican and A. Clark (eds), Machines and Thought, Oxford: Clarendon Press, pp. 137-64.
54. Gandy, R. [1980]: 'Church's Thesis and Principles for Mechanism', in J. Barwise, H. J. Keisler and K. Kunen (eds), The Kleene Symposium, Amsterdam: North-Holland, pp. 123-48.
55. Gavaldà, R. and Siegelmann, H. [1997]: Discontinuities in Recurrent Neural Networks, NeuroCOLT Technical Report NC-TR-97-037.
56. Geroch, R. and Hartle, J. B. [1986]: 'Computability and Physical Theories', Foundations of Physics, 16, pp. 533-50.
57. Goertzel, B. [1994]: Chaotic Logic, New York: Plenum Press.
58. Gottesman, D. [2000]: 'An Introduction to Quantum Error Correction', Proceedings of the Symposia of Applied Mathematics, Providence, RI: AMS.
59. Hamkins, J. D. and Lewis, A. [2000]: 'Infinite Time Turing Machines', Journal of Symbolic Logic, 65, pp. 567-604.
60. Jozsa, R. [1999]: 'Quantum effects in algorithms', Chaos, Solitons and Fractals, 10, pp. 1657-64.
61. Kalmár, L. [1959]: 'An argument against the plausibility of Church's Thesis', in A. Heyting (ed.), Constructivity in Mathematics, Amsterdam: North-Holland, pp. 72-80.
62. Kampis, G. [1991]: Self-Modifying Systems In Biology And Cognitive Science, Oxford: Pergamon Press.
63. Kampis, G. [1995]: 'Computability, Self-Reference, and Self-Amendment', Communications and Cognition-Artificial Intelligence, 12, pp. 91-109.
64. Kieu, T. D. [2001]: Quantum Algorithm for the Hubert's Tenth Problem, arXiv:quant-ph/0110136, preprint.
65. Kieu, T. D. [2002]: Computing the noncomputable, arXiv:quant-ph/0203034, preprint.
66. Knill, E. [1996]: Quantum Randomness and Nondeterminism, LANL report LAUR-96-2186.
67. Koshelev, M. and Kreinovich, V. [1997]: 'Towards Computers of Generation Omega - Non-Equilibrium Thermodynamics, Granularity, and Acausal Processes: A Brief Survey', Proceedings of the International Conference on Intelligent Systems and Semiotics (ISAS '97), Gaithersburg, MD: National Institute for Standards and Technology Publications, pp. 383-8.
68. Kreisel, G. [1970a]: 'Church's Thesis: A Kind of Reducibility Axiom for Constructive Mathematics', in A. Kino, J. Myhill and R. E. Vesley (eds), Intuitionism and Proof Theory, Amsterdam: North-Holland, pp. 121-50.
69. Kreisel, G. [1970b]: 'Hilbert's Pogramme and the Search for Automatic Proof Procedures', Proceedings of the IRIA Symposium on Automatic Demonstration, Berlin: Springer, pp. 128-46.
70. Linden, N. and Popescu, P. A. [1999]: Good Dynamics Versus Bad Kynematics. Is Entanglement Needed For Quantum Computation?, quant-ph 9906008 v2, preprint.
71. Lloyd, S. [1993]: 'Quantum Computers and Uncomputability', Physical Review Letters, 71, pp. 943-6.
72. Lloyd, S. [2000]: 'Ultimate physical limits to computation', Nature, 406, pp. 1047-54.
73. Lloyd, S. [2002]: 'Computational capacity of the universe', Physical Review Letters, 88, 237901.
74. Lokhorst, G.-J. C. [2000], 'Why I Am Not a Super Turing Machine', Workshop on Hypercomputation, London, University College.
75. Lomonaco, S. J. Jr [2000]: 'A Rosetta stone for quantum mechanics with an introduction to quantum computation', Washington DC: AMS Short Course Lecture Note.
76. Løfgren, L. [1968]: 'An Axiomatic Explanation of Complete Self-Reproduction", Bulletin of Mathematical Biophysics, 30, pp. 415-25.
77. Maass, W. and Orponen, P. [1998]: 'On the effect of noise in discrete-time analog computations', Neural Computation, 10, pp. 1071-95.
78. Maass, W. and Sontag, E. D. [2000]: A Precise Characterization of the Class of Languages Recognized by Neural Nets under Gaussian and other Common Noise Distributions, NeuroCOLT2 Technical Report NC2-TR-2000-63.
79. Machtey, M. and Young, P. [1978]: An Introduction to the General Theory of Algorithms, New York: Elsevier.
80. Manin, Yu. [1977]: A Course in Mathematical Logic, New York: Springer.
81. McLennan, B. J. [1993]: 'Grounding Analog Computers', Think, 2, pp. 48-51.
82. Mendelson, E. [1964]: Introduction to Mathematical Logic, Princeton: Van Nostrand.
83. Meer, K. and Michaux, C. [1997]: 'A survey on real structural complexity theory', Bulletin of the Belgian Mathematical Society, 4, pp. 113-48.
84. Mitchison, G. and Jozsa, R. [2001]: 'Counterfactual computation', Proceedings of the Royal Society, A 457, pp. 1175-94.
85. Moore, C. [1990]: 'Unpredictability and Undecidability in Dynamical Systems', Physical Review Letters, 64, pp. 2354-7.
86. Moore, C. [1996]: 'Recursion Theory on the Reals and Continuous-Time Computation', Theoretical Computer Science, 162, pp. 23-44.
87. Moravec, H. [1992]: Time Travel and Computing', Extropy, 9, pp. 15-20.
88. Nelson, R. J. [1987]: 'Church's Thesis and Cognitive Science', Notre Dame Journal of Formal Logic, 28, pp. 581-614.
89. Ng, Y. J. [2001]: 'From Computation to Black Holes and Space-Time Foam', Physical Review Letters, 86, p. 2946.
90. Nielsen, M. A. [1997]: 'Computable functions, quantum measurements, and quantum dynamics', Physical Review Letters, 79, pp. 2915-18.
91. Nielsen, M. A. [2000]: On The Units Of Bipartite Entanglement: Is Sixteen Ounces Of Entanglement Always Equal To One Pound?, arXiv:quant-ph/0011063, preprint.
92. Ozawa, M. [1998]: Measurability and Computability, quant-ph 9809048, preprint.
93. Ozawa, M. [2000]: 'Quantum Turing machines: local transition, preparation, measurement, and halting', in P. Kumer et al (eds), Quantum Communication, Computing, and Measurement 2, New York: Kluwer, pp. 241-8.
94. Pakvasa, S., Simmons, W. and Tata, X. [1999]: Relativistic Quantum Computing, arXiv:quant-ph/9911091, preprint.
95. Penrose, R. [1989]: The Emperor's New Mind, Oxford: Oxford University Press.
96. Penrose, R. [1994]: Shadows of the Mind, Oxford: Oxford University Press.
97. Penrose, R. [2000]: The Large, the Small and the Human Mind, Cambridge: Canto/ Cambridge University Press.
98. Péter, R. [1959]: 'Rekursivität und Konstruktivität', in A. Heyting (ed.), Constructivity in Mathematics, Amsterdam: North-Holland, pp. 226-33.
99. Pitowsky, I. [2002]: 'Quantum Speed-up of Computations', Philosophy of Science, 69, pp. 168-77.
100. Pitowsky, I. and Shagrir, O. [2003]: 'Physical Hypercomputation and The Church-Turing Thesis', Minds and Machines.
101. Pour-El, M. B. and Richards, J. I. [1981]: 'The Wave Equation with Computable Initial Data such that its Unique Solution is not Computable', Advances in Mathematics, 39, pp. 215-39.
102. Prasse, M. and Rittgen, P. [1998]: 'Why Church's Thesis Still Holds', Computer Journal, 41, pp. 357-62.
103. Raatikainen, P. [2000]: 'Algorithmic Information Theory and Undecidability', Synthese, 123, pp. 217-25.
104. Rocha, L. M. [1995]: 'Artificial Semantically Closed Objects', Communications and Cognition-Artificial Intelligence, 12, pp. 63-89.
105. Ropolyi, L. and szegedi, P. [1999]: 'Zenonian arguments in quantum mechanics', in D. Greenberger, W. L. Reiter and N. Zeilinger (eds), Epistemological and Experimental Perspectives in Quantum Mechanics, Dordrecht: Kluwer, pp. 253-6.
106. Rosen, R. [1962]: 'Church's Thesis and its relation to the concept of realizability in biology and physics', Bulletin of Mathematical Biophysics, 24, pp. 375-93.
107. Ross, D. [1974]: 'Church's Thesis: what its difficulties are and what are not', Journal of Philosophy, 71, pp. 515-25.
108. Rubel, L. A. [1989]: 'Digital simulation of analog computation and Church's Thesis', Journal of Symbolic Logic, 54, pp. 1011-17.
109. Rucker, R. [1977]: The One/Many Problem in the Foundations of Set Theory', in R. Gandy and M. Hyland (eds), Logic Colloquium 76, Amsterdam: North-Holland, pp. 567-93.
110. Rucker, R. [1983]: Infinity and the Mind, New York: Bantam Books.
111. Saari, D. G. and Xia, Z. J. [1995]: 'Off to Infinity in Finite Time', Notices of the American Mathematical Society, 42, pp. 538-46.
112. Shor, P. W. [1997]: 'Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer', SIAM Journal of Computing, 26, pp. 1484-509.
113. Shor, P. W. [1998]: 'Quantum Computing', Documenta Mathematica, ICM-I, pp. 467-86.
114. Siegelmann, H. [1995]: 'Computation Beyond the Turing Limit', Science, 268, pp. 545-8.
115. Siegelmann, H. and Sontag, E. D. [1994]: 'Analog Computation via Neural Networks', Theoretical Computer Science, 131, pp. 331-60.
116. Siegelmann, H. and Sontag, E. D. [1995]: 'On The Computational Power of Neural Nets', Journal of Computer and Systems Science, 50, pp. 132-50.
117. Smale, S. [1990]: 'Some remarks on the foundations of numerical analysis', SIAM Review, 32, pp. 211-20.
118. Smith, W. D. [1993]: Church's Thesis meets the N-body problem, NEC Research Technical Report, Princeton.
119. Smith, W. D. [1995]: Fundamental physical limits on computation, NEC Research Technical Report, Princeton.
120. Smith, W. D. [1999a]: Church's Thesis meets quantum mechanics, NEC Research Technical Report, Princeton.
121. Smith, W. D. [1999b]: History of 'Church's Theses' and a manifesto on converting physics into a rigorous algorithmic discipline, NEC Research Technical Report, Princeton.
122. Soare, R. L. [1996]: 'Computability and Recursion', Bulletin of Symbolic Logic, 2, pp. 284-321.
123. Solovay, R. [2000]: 'A Version of Ω for which ZFC can not Predict a Single Bit', in C. S. Calude and G: Paun (eds), Finite Versus Infinite: Contributions to an Eternal Dilemma, London: Springer, pp. 323-34.
124. Stannett, M. [1990]: 'X-Machines and the Halting Problem: Building a Super-Turing Machine', Formal Aspects of Computing, 2, pp. 331-41.
125. Stannett, M. [2001]: Computation and Hypercomputation, Department of Computer Science, University of Sheffield.
126. Steane, A. M. [1998]: 'Quantum Computing', Reports on Progress in Physics, 61, pp. 117-73.
127. Stenger, V. J. [2001]: 'Time's Arrows Point Both Ways. The View From Nowhen', Skeptic, 8, pp. 92-5.
128. Stern, A. [1988]: Matrix Logic, Amsterdam: North-Holland.
129. Stewart, I. [1991]: 'The Dynamics of Impossible Devices', Nonlinear Science Today, 1, pp. 8-9.
130. Suarez, A. [1998]: Does Quantum Mechanics imply influences acting backward in time in impact series experiments?, quant-ph 9801061, preprint.
131. Svozil, K. [1995]: 'On the computational power of physical systems, undecidability, the consistency of phenomena and the practical use of paradoxa', in D. M. Greenberger and A. Zeilinger (eds), Fundamentals Problems in Quantum Theory, New York: New York Academy of Sciences, pp. 834-41.
132. Svozil, K. [1998]: The Church-Turing thesis as a guiding principle for physics', in C. Calude, J. Casti and M. J. Dinneen (eds), Unconventional Models of Computation, Singapore: Springer, pp. 371-85.
133. Tipler, F. J. [1995]: The Physics of Immortality: Modern Cosmology, God and the Resurrection of the Dead, London: Macmillan.
134. Toffoli, T. [1998]: 'Quo vadimus? - Much hard work is still needed', Physica D: Nonlinear Phenomena, 120, pp. 1-11.
135. Toffoli, T. [1999]: 'Non-Conventional Computers', in J. G. Webster (ed.), Encyclopedia of Electrical and Electronics Engineering, New York: Wiley & Sons.
136. Tsirelson, B. [2001]: The quantum algorithm of Kieu does not solve the Hilbert's tenth problem, arXiv:quant-ph/0111009, preprint.
137. Turing, A. M. [1936]: 'On computable numbers, with an application to the Entscheidungsproblem', Proceedings of the London Mathematical Society, 42, pp. 230-65.
138. Vergis, A., Steiglitz and Dickinson, B. [1986]: 'The complexity of analog computation', Mathematics and Computers in Simulation, 28, pp. 91-113.
139. Webb, J. [1983]: 'Gödel's Theorems and Church's Thesis: A Prologue to Mechanism', in R. S. Cohen and M. W. Wartofsky (eds), Language, Logic and Method, Dordrecht: Reidel, pp. 309-53.
140. Wegner, P. [1997]: 'Why Interaction is More Powerful than Algorithms', Communications of the ACM, 40, pp. 80-91.
141. Wegner, P. [1998]: 'Interactive Foundations of Computing', Theoretical Computer Science, 192, pp. 315-51.
142. Weihrauch, K. and Zhong, N. [2002]: 'Is Wave Propagation Computable or can Wave Computers Beat the Turing Machine?', Proceedings of the London Mathematical Society, 85, pp. 312-32.
143. Welch, P. D. [2000]: 'The Length of Infinite Time Turing Machine Computations', Bulletin of the London Mathematical Society, 32, pp. 129-36.