Non-Turing computations via Malament-Hogarth space-times (2002)

by Gábor Etesi , István Németi
Citations:65 - 8 self

Documents Related by Co-Citation

125 Introducing Einstein’s relativity – R D’Inverno - 1992
35 The Church-Turing Thesis as a Guiding Principle for Physics – Karl Svozil
62 Quantum Algorithm For Hilberts Tenth Problem – Tien D Kieu - 2003
27 The myth of hypercomputation – M Davis - 2003
568 A Decision Method for Elementary Algebra and Geometry – A Tarski - 1948
393 Simulating Physics with Computers – Richard Feynman, Peter W. Shor - 1982
75 A.Lewis, Infinite time turing machines – Joel David Hamkins, Andy Lewis
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
1239 The large scale structure of space-time – S W Hawking, G F R Ellis - 1973
308 Classical Recursion Theory – P Odifreddi - 1989
43 general relativity allow an observer to view an eternity in a finite time – Mark L. Hogarth - 1992
30 Computing the non-computable – Tien D Kieu
482 Quantum complexity theory – Ethan Bernstein, Umesh Vazirani - 1993
148 Hilbert’s Tenth Problem – Y V Matiyasevich - 1993
125 System of logics based on ordinals – A M Turing - 1939
22 RELATIVISTIC COMPUTERS AND THE TURING Barrier – István Németi, Gyula Dávid - 2006
320 Algorithmic information theory – G. J. Chaitin - 1977
11 Deciding arithmetic using SAD computers – arXiv math LO9808093 Mark L Hogarth