Hypercomputation

From Qwiki

Jump to: navigation, search

The Hypercomputation studies all the Hypothetical methods for represent the solutions of the computing unsolvable problems and compute the Turing non-computable functions (also this models can resolve the solvable problems and compute the Turing computable functions), this term has been introduced by Jack Copeland and has given the form to the concept of meta-algorithm.


Hypothetical computing models

Oracle Machine

One Oracle Machine (abbreviated OTM), is one ordinary Turing Machine with one oracle (One black box), this black box use the input and resolve the problem (using one meta-algorithm) and print the solution (the blackbox output) in it tape, this machine use only two transictions for any input, before the black box computing state and other after the black box, and use only 3 states (q0,q1,q2) (q0 is the initial state, q1 is the black box state and q2 is the final and the accept state).

Zeno Machine

One Zeno Machine (abbreviated ZM, also called Accelerated Turing Machine), is one ordinary Turing Machine but this machine allow one countably infinite set of algorithmic steps, as conclusion, one very important collision with the definition of algorithm (one finite set of algorithmic steps),that's why this model is a Hypothetical computing model.