Discrete transfinite computation models

Cached

Download Links

by P. D. Welch

Active Bibliography

Transfinite Machine Models – P. D. Welch - 2011
The extent of computation in Malament-Hogarth – unknown authors - 2008
3 Characteristics of discrete transfinite time Turing machine models: halting times, stabilization times, and . . . – P.D. Welch - 2008
1 Abstract Super-Tasks, Accelerating Turing Machines and Uncomputability – Oron Shagrir
Supertask Computation – Benedikt Löwe, Wolfgang Malzkorn, Thoralf Räsch, Joel David Hamkins - 2002
16 The many forms of hypercomputation – Toby Ord - 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
10 Deciding arithmetic in Malament–Hogarth spacetimes – Mark Hogarth - 2001
1 ZENO MEETS MODERN SCIENCE – Z. K. Silagadze - 2005
Non-Turing Computers are the new Non-Euclidean Geometries – Mark Hogarth
75 A.Lewis, Infinite time turing machines – Joel David Hamkins, Andy Lewis
Alternatively: Π 1 – P. D. Welch Draft, Ca Σ
www.elsevier.com/locate/tcs Hypercomputation by de nition – Benjamin Wells - 2003
2 Computational Power of Infinite Quantum Parallelism – Martin Ziegler - 2005
On the calculating power of Laplace’s demon (Part I) – John Longley - 2006
1 How to acknowledge hypercomputation? – Alexander Leitsch, Günter Schachner, Karl Svozil - 2007
Vagueness, Rationality and Undecidability: A Theory Of Why . . . – Mark A. Changizi - 1999
3 On Characterizations of the Basic Feasible Functionals Part II – Robert J. Irwin, et al. - 2002
32 Computability and recursion – Robert I. Soare - 1996