Physical Hypercomputation and the Church–Turing Thesis (2003)

by Oron Shagrir, et al.
Citations:14 - 1 self

Documents Related by Co-Citation

143 Neural networks and analog computation: beyond the Turing machine – H Siegelmann - 1999
9 Turing computability and Malament-Hogarth spacetimes – G Etesi, I Németi
21 Hypercomputation and the Physical Church-Turing Thesis – Paolo Cotogno - 2003
18 nite pains: the trouble with supertasks, in – J Earman, J D Norton, In - 1996
14 The physical Church thesis and physical computational complexity, Iyyun 39 – I Pitowsky - 1990
9 Deciding Arithmetic Using SAD Computers." British Journal for the Philosophy of Science 55 – M L Hogarth - 2004
23 Church's thesis meets the N-body problem – Warren D. Smith - 1999
28 Accelerated Turing Machines – B. Jack Copeland - 2002
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
67 Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers – M B Pour-El - 1974
6 On logic, relativity, and the limitations of human knowledge – I Németi - 1987
7 Twin Paradox and the logical foundation of space-time. Foundation of Physics – Judit X. Madarász, István Németi, Gergely Székely
7 The effects of gravitation on clocks, proved in axiomatic relativity. Abstracts for the conference “Logic – J X Madarász, G Székely
9 Relativistic computers and non-uniform complexity theory – J Wiedermann, J van Leeuwen - 2002
7 On the traversability of the Cauchy horizon: Herman and Hiscock’s argument revisited – A Ori - 1997
16 Forever Is a Day: Supertasks – J Earman, J D Norton - 1993
22 RELATIVISTIC COMPUTERS AND THE TURING Barrier – István Németi, Gyula Dávid - 2006
7 Predictability, Computability and Spacetime – Mark Hogarth, George Boolos, Tim Budden, Rob Clifton, John Earman, Bob Geroch, Joseph Melia, John Norton, Michael Redhead, Adrian Stanley - 2002