Hypercomputation
Hypercomputation or super-Turing computation is a set of hypothetical
The Church–Turing thesis states that any "computable" function that can be computed by a mathematician with a pen and paper using a finite set of simple algorithms, can be computed by a Turing machine. Hypercomputers compute functions that a Turing machine cannot and which are, hence, not computable in the Church–Turing sense.
Technically, the output of a
History
A computational model going beyond Turing machines was introduced by Alan Turing in his 1938 PhD dissertation Systems of Logic Based on Ordinals.[1] This paper investigated mathematical systems in which an oracle was available, which could compute a single arbitrary (non-recursive) function from naturals to naturals. He used this device to prove that even in those more powerful systems, undecidability is still present. Turing's oracle machines are mathematical abstractions, and are not physically realizable.[2]
State space
In a sense, most functions are uncomputable: there are computable functions, but there are an
Models
Hypercomputer models range from useful but probably unrealizable (such as Turing's original oracle machines), to less-useful random-function generators that are more plausibly "realizable" (such as a
Uncomputable inputs or black-box components
This section is in prose. is available. (July 2023) |
A system granted knowledge of the uncomputable, oracular Chaitin's constant (a number with an infinite sequence of digits that encode the solution to the halting problem) as an input can solve a large number of useful undecidable problems; a system granted an uncomputable random-number generator as an input can create random uncomputable functions, but is generally not believed to be able to meaningfully solve "useful" uncomputable functions such as the halting problem. There are an unlimited number of different types of conceivable hypercomputers, including:
- Turing's original oracle machines, defined by Turing in 1939.
- A real computer (a sort of idealized analog computer) can perform hypercomputation[4] if physics admits general real variables (not just computable reals), and these are in some way "harnessable" for useful (rather than random) computation. This might require quite bizarre laws of physics (for example, a measurable physical constant with an oracular value, such as Chaitin's constant), and would require the ability to measure the real-valued physical value to arbitrary precision, though standard physics makes such arbitrary-precision measurements theoretically infeasible.[5]
- Similarly, a neural net that somehow had Chaitin's constant exactly embedded in its weight function would be able to solve the halting problem,[6] but is subject to the same physical difficulties as other models of hypercomputation based on real computation.
- Certain fuzzy logic-based "fuzzy Turing machines" can, by definition, accidentally solve the halting problem, but only because their ability to solve the halting problem is indirectly assumed in the specification of the machine; this tends to be viewed as a "bug" in the original specification of the machines.[7][8]
- Similarly, a proposed model known as
- Dmytro Taranovsky has proposed a finitistic model of traditionally non-finitistic branches of analysis, built around a Turing machine equipped with a rapidly increasing function as its oracle. By this and more complicated models he was able to give an interpretation of second-order arithmetic. These models require an uncomputable input, such as a physical event-generating process where the interval between events grows at an uncomputably large rate.[11]
- Similarly, one unorthodox interpretation of a model of unbounded nondeterminism posits, by definition, that the length of time required for an "Actor" to settle is fundamentally unknowable, and therefore it cannot be proven, within the model, that it does not take an uncomputably long period of time.[12]
"Infinite computational steps" models
In order to work correctly, certain computations by the machines below literally require infinite, rather than merely unlimited but finite, physical space and resources; in contrast, with a Turing machine, any given computation that halts will require only finite physical space and resources.
A Turing machine that can complete infinitely many steps in finite time, a feat known as a
It seems natural that the possibility of time travel (existence of closed timelike curves (CTCs)) makes hypercomputation possible by itself. However, this is not so since a CTC does not provide (by itself) the unbounded amount of storage that an infinite computation would require. Nevertheless, there are spacetimes in which the CTC region can be used for relativistic hypercomputation.[14] According to a 1992 paper,[15] a computer operating in a Malament–Hogarth spacetime or in orbit around a rotating black hole[16] could theoretically perform non-Turing computations for an observer inside the black hole.[17][18] Access to a CTC may allow the rapid solution to PSPACE-complete problems, a complexity class which, while Turing-decidable, is generally considered computationally intractable.[19][20]
Quantum models
Some scholars conjecture that a
"Eventually correct" systems
Some physically realizable systems will always eventually converge to the correct answer, but have the defect that they will often output an incorrect answer and stick with the incorrect answer for an uncomputably large period of time before eventually going back and correcting the mistake.
In mid 1960s,
A symbol sequence is computable in the limit if there is a finite, possibly non-halting program on a
Analysis of capabilities
Many hypercomputation proposals amount to alternative ways to read an
Model | Computable predicates | Notes | Refs |
---|---|---|---|
supertasking | dependent on outside observer | [28] | |
limiting/trial-and-error | [23] | ||
iterated limiting (k times) | [25] | ||
Blum–Shub–Smale machine | incomparable with traditional computable real functions
|
[29] | |
Malament–Hogarth spacetime | HYP
|
dependent on spacetime structure | [30] |
analog recurrent neural network | f is an advice function giving connection weights; size is bounded by runtime | [31][32] | |
infinite time Turing machine | Arithmetical Quasi-Inductive sets | [33] | |
classical fuzzy Turing machine | for any computable t-norm | [8] | |
increasing function oracle | for the one-sequence model; are r.e. | [11] |
Criticism
Martin Davis, in his writings on hypercomputation,[34][35] refers to this subject as "a myth" and offers counter-arguments to the physical realizability of hypercomputation. As for its theory, he argues against the claims that this is a new field founded in the 1990s. This point of view relies on the history of computability theory (degrees of unsolvability, computability over functions, real numbers and ordinals), as also mentioned above. In his argument, he makes a remark that all of hypercomputation is little more than: "if non-computable inputs are permitted, then non-computable outputs are attainable."[36]
See also
References
- .
- ^ "Let us suppose that we are supplied with some unspecified means of solving number-theoretic problems; a kind of oracle as it were. We shall not go any further into the nature of this oracle apart from saying that it cannot be a machine" (Undecidable p. 167, a reprint of Turing's paper Systems of Logic Based On Ordinals)
- S2CID 5826757.
- ^ Arnold Schönhage, "On the power of random access machines", in Proc. Intl. Colloquium on Automata, Languages, and Programming (ICALP), pages 520–529, 1979. Source of citation: Scott Aaronson, "NP-complete Problems and Physical Reality"[1] p. 12
- ^ Andrew Hodges. "The Professors and the Brainstorms". The Alan Turing Home Page. Retrieved 23 September 2011.
- .
- S2CID 12513452.
- ^ .
Their (ability to solve the halting problem) is due to their acceptance criterion in which the ability to solve the halting problem is indirectly assumed.
- ^ Edith Spaan; Leen Torenvliet; Peter van Emde Boas (1989). "Nondeterminism, Fairness and a Fundamental Analogy". EATCS Bulletin. 37: 186–193.
- .
- ^ a b Dmytro Taranovsky (July 17, 2005). "Finitism and Hypercomputation". Retrieved Apr 26, 2011.
- ^ Hewitt, Carl. "What Is Commitment." Physical, Organizational, and Social (Revised), Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS (2006).
- S2CID 253434.
- S2CID 16816151.
- S2CID 120917288.
- ISBN 978-3-540-35466-6.
- S2CID 17081866.
- S2CID 122764068.
- S2CID 16136314.
- ^ S. Aaronson and J. Watrous. Closed Timelike Curves Make Quantum and Classical Computing Equivalent [2]
- ..
- .
- ^ .
- ^ S2CID 44655062.
- ^ S2CID 2071951.
- arXiv:quant-ph/0011122.
- .
- S2CID 6749770.
- ISBN 978-0-387-98281-6.)
{{cite book}}
: CS1 maint: multiple names: authors list (link - .
- S2CID 17495161.
- .
- .
- .
- ^ Davis, Martin (2004). "The Myth of Hypercomputation". Alan Turing: Life and Legacy of a Great Thinker. Springer.
- ^ Martin Davis (Jan 2003). "The Myth of Hypercomputation". In Alexandra Shlapentokh (ed.). Miniworkshop: Hilbert's Tenth Problem, Mazur's Conjecture and Divisibility Sequences (PDF). MFO Report. Vol. 3. Mathematisches Forschungsinstitut Oberwolfach. p. 2.
Further reading
- Aoun, Mario Antoine (2016). "Advances in Three Hypercomputation Models" (PDF). Electronic Journal of Theoretical Physics. 13 (36): 169–182.
- Burgin, M. S. (1983). "Inductive Turing Machines". Notices of the Academy of Sciences of the USSR. 270 (6): 1289–1293.
- Burgin, Mark (2005). Super-recursive algorithms. Monographs in computer science. Springer. ISBN 0-387-95569-0.
- Cockshott, P.; Michaelson, G. (2007). "Are there new Models of Computation? Reply to Wegner and Eberbach". The Computer Journal. .
- Cooper, S. B.; Odifreddi, P. (2003). "Incomputability in Nature" (PDF). In Cooper, S. B.; Goncharov, S. S. (eds.). Computability and Models: Perspectives East and West. New York, Boston, Dordrecht, London, Moscow: Plenum Publishers. pp. 137–160. Archived from the original (PDF) on 2011-07-24. Retrieved 2011-06-16.
- Cooper, S. B. (2006). "Definability as hypercomputational effect". Applied Mathematics and Computation. 178: 72–82. S2CID 1487739.
- Copeland, J. (2002). "Hypercomputation" (PDF). Minds and Machines. 12 (4): 461–502. S2CID 218585685. Archived from the original(PDF) on 2016-03-14.
- Hagar, A.; Korolev, A. (2007). "Quantum Hypercomputation—Hype or Computation?*" (PDF). Philosophy of Science. 74 (3): 347–363. S2CID 9857468.
- Ord, Toby (2002). "Hypercomputation: Computing more than the Turing machine can compute: A survey article on various forms of hypercomputation". arXiv:math/0209332.
- Piccinini, Gualtiero (June 16, 2021). "Computation in Physical Systems". Stanford Encyclopedia of Philosophy. Retrieved 2023-07-31.
- Sharma, Ashish (2022). "Nature Inspired Algorithms with Randomized Hypercomputational Perspective". Information Sciences. 608: 670–695. S2CID 248881264.
- Stannett, Mike (1990). "X-machines and the halting problem: Building a super-Turing machine". Formal Aspects of Computing. 2 (1): 331–341. S2CID 7406983.
- Stannett, Mike (2006). "The case for hypercomputation" (PDF). Applied Mathematics and Computation. 178 (1): 8–24. doi:10.1016/j.amc.2005.09.067. Archived from the original(PDF) on 2016-03-04.
- Syropoulos, Apostolos (2008). Hypercomputation: Computing Beyond the Church–Turing Barrier. Springer. ISBN 978-0-387-30886-9.