Summary Of: Super-recursive algorithm

Encyclodia Page On: Super-recursive algorithm

These Are Links To Other Documents

| neutrality | factual accuracy | talk page | computer science | computability theory | algorithms | Turing machines | anytime algorithms | algorithms | Anytime algorithms | Newton-Raphson | Church-Turing thesis | algorithms | Turing machine | hypercomputation | hypercomputation | supertask | Turing machines | Turing machines | algorithm | anytime algorithm | algorithm | Turing machine | event loops | computable | universal Turing machine | Turing machines | Turing machines | Jürgen Schmidhuber | converges | Kurt Gödel | halting problem | theories of everything | | citations | verification | reliable references | challenged | Church–Turing thesis | quantum algorithms | Martin Davis | arithmetical hierarchy | Kurt Gödel | Principia Mathematica | J. Schmidhuber | J. Schmidhuber | Kolmogorov | ISBN 0387955690 | MathSciNet | Zentralblatt MATH | Kleene, Stephen C. | Categories | Theory of computation | Accuracy disputes from April 2008 | NPOV disputes from April 2008 | Articles needing additional references from July 2008 |