Computation and hypercomputation

Minds and Machines

Volumn 13, Issue 1, 2003, Pages 115-153

  Stannett, Mike ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Church Turing thesis; Computability; Hypercomputation; Recursion; Scientific method; Super Turing machine

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; TURING MACHINES;

CHURCH-TURING THESIS; HYPERCOMPUTATION; SCIENTIFIC METHOD;

COMPUTABILITY AND DECIDABILITY;

EID: 0037317020     PISSN: 09246495     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021341202779     Document Type: Article

References (48)

1. Bains, S. and Johnson, J. (2000). 'Noise, physics and non-Turing computation' in Joint Conference on Information Systems, Atlantic City, 28 February - March 3, 2000. (http://citeseer.nj.nec.com/298231.html).
2. Benioff, P. (1980). 'The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Represented by Turing machines', Journal of Statistical Physics 22, pp. 563-591.
3. Bennett, C.H. (1993). 'Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels', Physics Review Letters 70, pp. 1895-1898.
4. Bennett, C.H. (1995). 'Quantum Information and Computation', Physics Today 48(10), pp. 24-30.
5. Boden, M. A. (1988). Computer Models of Mind, Cambridge, UK: Cambridge University Press.
6. Church, A. (1940). 'On the Concept of a Random Sequence', Bulletin of the American Mathematical Society 46, pp. 130-135.
7. Churchland, P.M. (1988). Matter and Consciousness, Cambridge, MA, USA: MIT Press.
8. Copeland, A.H. (1940). '[Review of] Alonzo Church. On the Concept of a Random Sequence. Bulletin of the American Mathematical Society, vol. 46 (1940), pp. 130-135'. Journal of Symbolic Logic 5(2), pp. 71-72.
9. Copeland, B.J. (1997). 'The Church-Turing Thesis' in E. Zalta, ed., The Stanford Encyclopedia of Philosophy. (http://plato.stanford.edu/entries/church-turing/).
10. Copeland, B.J. (1998a). 'Super Turing-Machines', Complexity 4, pp. 30-32.
11. Copeland, B.J. (1998b). 'Even Turing Machines Can Compute Uncomputable Functions' in C. Calude et al., eds., Unconventional Models of Computation, London: Springer, pp. 150-164.
12. Copeland, B.J. (2000). 'Narrow versus Wide Mechanism: Including a Re-examination of Turing's View on the Mind-Machine Issue', Journal of Philosophy 97(1), pp. 5-32.
13. Copeland, B.J. and Sylvan, R. (1999). 'Beyond the Universal Turing Machine', Australasian Journal of Philosophy 77, pp. 46-66.
14. Davies, E.B. (2001), 'Building Infinite Machines', British Journal for the Philosophy of Science 52(4), pp. 671-682.
15. Deutsch, D. (1985). 'Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer', Proceedings of the Royal Society of London A 400, pp. 97-117.
16. Dornheim, C. (1998). 'Undecidability of Plane Polygonal Mereotopology' in A. G. Cohn et al., eds. Principles of Knowledge Representation and Reasoning, Proceedings of the Sixth International Conference (KR'98), Trento, Italy, pp. 342-353.
17. Earman, J. (1995). Bangs, Crunches, Whimpers, and Shrieks - Singularities and Acausalities in Relativistic Spacetimes, Oxford: Oxford University Press.
18. Earman, J. and Norton, J. (1993). 'Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes', Philosophy of Science 5, pp. 22-42.
19. Feynman, R.P. (1986). 'Quantum Mechanical Computers', Foundations of Physics 16, pp. 507-531, reprinted from Optics News (February 1985), pp. 11-20.
20. Feynman, R.P. et al., (1965). The Feynman Lectures on Physics (3 volumes). Reading, MA: Addison-Wesley, 1965.
21. Gödel, K. (1931). 'Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I', Monatshefte für Mathematik und Physik 38, pp. 173-198. published in English translation as (Meltzer, 1962).
22. Goodstein, R.L., (1964). Recursive Number Theory, being part of L. Brouwer et al., eds., Studies in Logic and the Foundations of Mathematics, Amsterdam: North-Holland.
23. Gowland, P. and Lester, D. (1993). 'A Survey of Exact Computer Arithmetic' in Blanck, J. et al., eds., Proceedings of the Fourth Workshop on Computability and Complexity in Analysis (CCA2000), Swansea, Wales, Informatik Berichte 272-9/2000, FernUniversität, Fachbereit Informatik, Postfach 940, D-58084, Hagen, Germany, pp.99-115 [in English].
24. Hobson, E.W. (1923). The Domain of Natural Science, Cambridge, UK: Cambridge University Press, reissued as Hobson, E. W. (1968). The Domain of Natural Science, New York: Dover Publications.
25. Hogarth, M. (1992). 'Does General Relativity Allow an Observer to View an Eternity in a Finite Time?' Foundations of Physics Letters 5, pp. 173-181.
26. Hogarth, M. (1996). Predictability, computability, and spacetime, PhD Dissertation, Faculty of Philosophy, University of Cambridge [CambridgeUniversity Library, PhD 20754]
27. Holcombe, W. M. L. and Ipate, F. (1998). Correct system: Building a business Process Solution New York: Springer.
28. Lopez, J.L. (1996). 'Supersymmetry: from the Fermi scale to the Planck scale', Reports on Progress in Physics 59, pp. 819-865.
29. MacLennan, B.J. (1990). Field Computation: A Theoretical Framework for Massively Parallel Analog Computation, Parts I-IV, Technical Report CS-90-100, University of Tennessee, Knoxville, Computer Science Department. [http://citeseer.nj.nec.com/bruce90field.html]
30. MacLennan, B.J. (1993). 'Grounding Analog Computers', Think 2, pp. 48-51.
31. MacLennan, B.J. (1999). 'Field Computation in Natural and Artificial Intelligence', Information Sciences 119(1-2), pp. 73-89.
32. McLaughlin, W. (1997). Thomson's Lamp is Dysfunctional, Technical Report, Jet Propulsion Laboratory, California Institute of Technology, USA.
33. Meltzer, B. (1962). Kurt Gödel - On Formally Undecidable Propositions of Principia Mathematica and Related Systems. Edinburgh and London: Oliver & Boyd, being an English translation of (Gödel, 1931) with an introduction by R.B. Braithwaite.
34. Milner, R. (1989). Communication and Concurrency, Englewood Cliffs, NJ: Prentice-Hall International.
35. Myhill, J. (1971). 'A Recursive Function, Defined on a Compact Interval and Having a Continuous Derivative that is not Recursive', Michigan Mathematical Journal 18, pp. 97-98.
36. Pour-El, M.B. and Richards, I. (1979). 'A Computable Ordinary Differential Equation Which Possesses No Computable Solution', Annals of Mathematical Logic 17, pp. 61-90.
37. Pour-El, M.B. and Richards, I. (1981). 'The Wave Equation with Computable Initial Data such that its Unique Solution is not Computable', Advances in Mathematics 39, pp. 215-239.
38. Shor, P.W. (1994). 'Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer' in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, USA: IEEE Computer Society Press.
39. Siegelmann, H.T. (1999). 'Stochastic Analog Networks and Computational Complexity', Journal of Complexity 15, pp. 451-475.
40. Stannett, M. (1990). 'X-Machines and the Halting Problem: Building a Super-Turing Machine', Formal Aspects of Computing 2, pp. 331-341.
41. Stannett, M. (1991). An Introduction to Post-Newtonian and Non-Turing computation. Technical Report CS-91-02, Department of Computer Science, Sheffield University, UK.
42. Stannett, M. (2001). Computation over arbitrary temporal models (a possible unification of discrete, analog, and hybrid computation), Technical Report CS-01-08, Dept of Computer Science, Sheffield University, UK.
43. Stannett, M. (2002). 'Complete Behavioural Testing (two extensions to state-machine testing)', Proceedings of Formal Approaches to Testing (FATES 2002), Brno, Czech Republic, August 2002, to appear.
44. Steane, A. (1998). 'Quantum Computing', Reports on Progress in Physics 61, pp. 117-173.
45. Thomson, J. (1954-1955), 'Tasks and Super-Tasks', Analysis XV, pp. 1-13.
46. Turing, A.M. (1945). 'Proposal for Development in the Mathematics Division of an Automatic Computing Engine (ACE)' in B.E. Carpenter and R.W. Doran, eds. (1986), A. M. Turing's ACE Report of 1946 and Other Papers, Cambridge, MA, USA: MIT Press.
47. Turing, A.M. (1948). 'Intelligent Machinery' (National Physical Laboratory Report) in B. Meltzer and D. Michie, eds. (1969). Machine Intelligence 5, Edinburgh: Edinburgh University Press.
48. Vuillemin, J. (1987). Exact Real Arithmetic with Continued Fractions, Technical Report, Institut de Recherche en Informatique et Automatique, 78150, Rocquencourt, France.