Hypercomputer

HISTORY

A model more powerful than Turing machines was introduced by Alan Turing in his 1939 paper ''Systems of logic based on ordinals''. This paper investigated mathematical systems in which an Oracle was available, which could compute a single arbitrary (non-recursive) function from Natural s to naturals. He used this device to prove that even in those more powerful systems, undecidability is present. Turing's writing made it clear that oracle machines were only mathematical abstractions, and could not, in fact, be physically realized (see The Turing Quote ).

THE CHALLENGE OF HYPERCOMPUTATION

Today, Algorithmic Information Theory helps us understand better what is required for hypercomputation. The hallmark of a hypercomputer is that it can solve the general Halting Problem , a feat impossible for ordinary computers. However, a normal computer can calculate the Halting Predicate of any program given the Halting Probability

\Omega

, which is a Random real, and holds an infinite amount of Information .

\Omega

, then, is an oracle for the Halting Problem . This quantity requires infinitely many bits to represent on any medium (essentially it is incompressible), and there is no Effective Procedure to calculate it. A hypercomputer must, however, obtain Omega by some other means than familiar Turing computation. For ordinary Discrete Computer s, there is an approximation procedure from below that will approximate Omega using a simple time-sharing program. However, the program can never know, at any given instant, how close it is to Ω.

THEORETICAL AND CONCEPTUAL POSSIBILITIES FOR A HYPERCOMPUTER

A discrete computer that has access to the halting probability $\Omega$ can solve the halting problem. For an n-bit input program, the first n bits of $\Omega$ are read, which gives the number of halting programs $k$ among all $2^n$ programs. Then, we timeshare all candidate programs with a simple watchguard policy. At step $i$ , we run each candidate program for $i$ steps. This iteration continues until $k$ programs terminate, and we have all n-bit programs that terminate. Then, we simply check if the input program is among these $k$ programs.

A Turing machine that can ''complete'' infinitely many steps.¹ (see Supertask )

A Real Computer (a sort of idealized Analog Computer ) might be able to perform hypercomputation if physics admits general Real variables (not just Computable Reals ), and these are in some way "harnessable" for 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 at minimum require the ability to measure a real-valued physical value to arbitrary precision despite Thermal Noise and Quantum Effects .

A Quantum Mechanical system which somehow uses (for example) an infinite superposition of states to compute a non- Recursive Function ². Such a system could not be an ordinary Qubit Quantum Computer because it has been proved that regular quantum computers are Turing reducible (they may yield speedup for some problems, but they don't allow solving ''new'' problems).

A digital computer in a specially constructed Spacetime , which enables it to perform an infinite number of operations while remaining in the past Light Cone of a particular Spacetime Event .

At this stage, none of these devices seem physically plausible. Thus, hypercomputers are likely to remain as mathematical models.

SEE ALSO

The Church-Turing Thesis

NOTES

#Simply being able to run for an unbounded number of steps (forever, i.e. potential infinity) does not suffice. On the other hand, notion of Computation In The Limit does. If we consider again the approximation procedure for Omega, this is a very slowly monotonically converging approximation. While every number in the series of approximation is computable, the limit

\Omega

is not. If the device can realize ''all'' of these infinitely many approximation steps, and obtains directly Omega, and stores it in its infinite extent, then it can easily solve the halting problem.
#There have been some claims to this effect; see Tien Kieu, ''Quantum Algorithm for Hilbert's Tenth Problem'' : & the ensuing literature. Errors have been pointed out in Kieu's paper (cf. [3 ) and, in more recent papers, Kieu has downgraded his claims from "a quantum algorithm that solves an uncomputable problem" to "a quantum algorithm that might be solving an uncomputable problem". [4]

REFERENCES

#Alan Turing, ''Systems of logic based on ordinals'', Proc. London math. soc., 45, 1939
#Tien Kieu, ''Quantum Algorithm for the )
#Boris Tsirelson. ''The quantum algorithm of Kieu does not solve the Hilbert's tenth problem''. e-print archive quant-ph/0111009 ( PDF )
#Tien Kieu, ''Reply to "The quantum algorithm of Kieu does not solve the Hilbert's tenth problem"''. e-print archive quant-ph/0111020 ( PDF )
#Hava Siegelman. ''Neural Networks and Analog Computation: Beyond the Turing Limit'' Boston: Birkhäuser.
#Hava Siegelmann. ''The simple dynamics of super Turing theories'' ; Theoretical Computer Science Volume 168, Issue 2, 20 November 1996, Pages 461-472. (link is to ScienceDirect website copy)
#Keith Douglas. '' Super-Turing Computation: a Case Study Analysis '' ( PDF ), M.S. Thesis, Carnegie Mellon University, 2003.
#L. Blum, F. Cucker, M. Shub, S. Smale, ''Complexity and Real Computation'', Springer-Verlag 1997. General development of complexity theory for Abstract Machine s that compute on real or Complex Number s instead of bits.
#Thomas Natschläger et al. ''the "Liquid Computer": A Novel Strategy for Real-Time Computing on Time Series''
#http://www.nature.com/nsu/010329/010329-8.html A Nature article on the above.
# On the computational power of neural nets

Information About

Hypercomputer