## How to acknowledge hypercomputation? (2007)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Leitsch07howto,

author = {Alexander Leitsch and Günter Schachner and Karl Svozil},

title = {How to acknowledge hypercomputation?},

year = {2007}

}

### OpenURL

### Abstract

We discuss the question of how to operationally validate whether or not a “hypercomputer” performs better than the known discrete computational models.

### Citations

1278 | On computable numbers, with an application to the Entscheidungsproblem - Turing - 1936 |

1080 | The Knowledge Complexity of Interactive Proof Systems
- Goldwasser, Micali, et al.
(Show Context)
Citation Context ...on the input length. In the literature, specific classes of interactive proof systems are investigated as well, for example, the Arthur|Merlin class [31] and the Goldwasser|Micali|Rackoff (GMR) class =-=[32]-=-. The former uses public coin tosses, with the intention of accommodating certain languages in the lowest complexity class possible. The latter uses private coin tosses, with the intention of covering... |

939 | Language identification in the limit - Gold - 1967 |

874 | Theory of Recursive Functions and Effective Computability - ROGERS - 1967 |

578 | A new kind of science
- Wolfram
(Show Context)
Citation Context ...ac.at We discuss the question of how to operationally validate whether or not a “hypercomputer” performs better than the known discrete computational models. 1. Introduction It is widely acknowledged =-=[1, 2]-=-, that every physical system corresponds to a computational process, and that every computational process, if applicable, has to be physically and operationally feasible in some concrete realization. ... |

336 | Algorithmic Information Theory
- Chaitin
- 1987
(Show Context)
Citation Context ...ar or atomic scales, the physical geometry might turn out to be not as straightforward as it appears from larger scales; for example, the object might turn out to be a fractal. Chaitin’s omega number =-=[4]-=-, which is interpretable as the halting probability of a universal computer, can be “computed in the limit” (without any computable radius of convergence) by a finite-size program in infinite time and... |

322 | Classical recursion theory - Odifreddi - 1989 |

315 |
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes
- Babai, Moran
- 1988
(Show Context)
Citation Context ...ance in cryptography. (The protocol we presented does not have the zero-knowledge property, unless GNI œ BPP, but can be modified to have it.) For further information on interactive proof systems see =-=[33, 34]-=-. 3.3 Inference of Problems One may confront the hypercomputer with the problem of comparing the solutions of multiple tasks. Such a comparison need not necessarily involve the separate computation of... |

304 | Trading group theory for randomness
- Babai
- 1985
(Show Context)
Citation Context ...stance the number of messages depends polynomially on the input length. In the literature, specific classes of interactive proof systems are investigated as well, for example, the Arthur|Merlin class =-=[31]-=- and the Goldwasser|Micali|Rackoff (GMR) class [32]. The former uses public coin tosses, with the intention of accommodating certain languages in the lowest complexity class possible. The latter uses ... |

267 | Toward a mathematical theory of inductive inference - Blum, Blum - 1975 |

198 |
The Foundations of Cryptography
- Goldreich
- 2004
(Show Context)
Citation Context ...ance in cryptography. (The protocol we presented does not have the zero-knowledge property, unless GNI œ BPP, but can be modified to have it.) For further information on interactive proof systems see =-=[33, 34]-=-. 3.3 Inference of Problems One may confront the hypercomputer with the problem of comparing the solutions of multiple tasks. Such a comparison need not necessarily involve the separate computation of... |

128 | A new kind of science. Wolfram - Wolfram - 2002 |

120 | Computability and Unsolvability - Davis - 1983 |

103 | On the Rapid Computation of Various Polylogarithmic Constants - Bailey, Borwein, et al. |

66 | The Undecidable - Davis, ed - 1965 |

60 | Quantum algorithm for the Hilbert’s Tenth Problem - Kieu - 2003 |

60 | Inductive reasoning and Kolmogorov complexity - Li, Vitanyi - 1992 |

47 | Exploring Randomness - Chaitin - 2001 |

44 |
Ip = pspace
- Shamir
- 1992
(Show Context)
Citation Context ...he class of interactive proofs by IP, we have shown that GNI œ IP. Interactive proofs further exist for every language in PSPACE (which is assumed to be much larger than NP). In fact, it can be shown =-=[30]-=- that IP equals PSPACE. This means, in particular, that IP is closed under complement. The protocol in the example given has the property that in each round a constant number of messages is sent. In a... |

43 | Inductive Inference and Unsolvability - Adleman, Blum - 1991 |

40 | Non-Turing Computers and Non-Turing Computability - Hogarth - 1994 |

40 | Philosophical Problems of Space and Time - Grünbaum - 1974 |

35 | The Church-Turing thesis as a guiding principle for physics - Svozil - 1998 |

33 | Infeld L. Evolution of Physics - Einstein - 1948 |

33 | Formal inductive inference - Angluin, Smith |

32 | Forever is A Day - Earman, Norton - 1993 |

32 |
Information and Randomness—An Algorithmic Perspective
- Calude
- 2002
(Show Context)
Citation Context ... in principle, learn nothing about the individual functional values alone. 3.4 Generation of Random Sequences By implementing Chaitin’s “algorithm” to compute Chaitin’s omega [35] or variants thereof =-=[36]-=-, it would in principle be possible to “compute” the first bits of random sequences. Such random sequences could, in principle, be subject to the usual tests of stochasticity [37, 38]. Note that in qu... |

31 | Computing the noncomputable - Kieu - 2003 |

28 |
A physicist's second reaction to mengenlehre, Scripta Math. 2
- Bridgman
- 1934
(Show Context)
Citation Context ...he mathematical formalism on the one hand, and the particular physical system that is represented by that formalism on the other hand, demand careful attention. If one insists on operationalizability =-=[3]-=-, one need not go very far in the history of mathematics to encounter suspicious mathematical objects. Surely enough, the number p can be defined and effectively computed as the ratio of the circumfer... |

24 | Infinity and the Mind - Rucker - 1982 |

23 | Algorithmic Information Theory; Cambridge - Chaitin - 1987 |

22 | The quantum coin toss—testing microphysical undecidability
- Svozil
- 1990
(Show Context)
Citation Context ... or variants thereof [36], it would in principle be possible to “compute” the first bits of random sequences. Such random sequences could, in principle, be subject to the usual tests of stochasticity =-=[37, 38]-=-. Note that in quantum mechanics, the randomness of certain microphysical events, such as the spontaneous decay of excited quantum states [39, 40], or the quantum coin toss experiments in complete con... |

21 | Foundations of Cryptography - Basic Tools, Cambridge U - Goldreich - 2001 |

20 | Tasks, supertasks, and the modern Eleatics - Benacerraf - 1962 |

19 | The physical Church-Turing thesis and physical computational complexity - Pitowsky - 1990 |

18 | Transcending the limits of Turing computability - Adamyan, Calude, et al. |

17 | The many forms of hypercomputation
- Ord
- 2006
(Show Context)
Citation Context ...ledge Hypercomputation? 133 Motivated by recent proposals to utilize quantum computation for trespassing the Turing barrier [19|22], these accelerating Turing machines have been intensively discussed =-=[23]-=- among other forms of hypercomputation [24|26]. Certainly, the almost ruthless and consequential application of seemingly mind-boggling theories such as quantum mechanics, as far as finitistic methods... |

16 | Why there is no such discipline as hypercomputation - Davis - 2006 |

13 | Computability & Unsolvability (McGraw-Hill - Davis - 1958 |

12 | Forever is a day: Supertasks in Pitowsky and Malament-Hogarth spacetimes - Earman, Norton - 1993 |

11 | Computational Universes
- Svozil
- 2005
(Show Context)
Citation Context ...ac.at We discuss the question of how to operationally validate whether or not a “hypercomputer” performs better than the known discrete computational models. 1. Introduction It is widely acknowledged =-=[1, 2]-=-, that every physical system corresponds to a computational process, and that every computational process, if applicable, has to be physically and operationally feasible in some concrete realization. ... |

10 | A new measure of the difficulty of problems
- Calude, Calude, et al.
(Show Context)
Citation Context ... algorithmically interpreted. For instance, for a particular universal computer, Goldbach’s conjecture and Riemann’s hypothesis could be decided with programs of size 3484 and 7780 bits, respectively =-=[6]-=-. Yet, omega appears to have two features which are normally considered contradictory: it is one of the most informative mathematical numbers imaginable, yet at the same time this information is so co... |

10 | The Myth of Hypercomputation. Alan Turing: Life and Legacy of a Great - Davis - 2004 |

10 | Infinity and the Mind. Birkhäuser - Rucker - 1982 |

10 | The Undecidable (Raven - Davis - 1965 |

9 | Exact approximations of Omega numbers
- Calude, Dinneen
- 2007
(Show Context)
Citation Context ...nce) by a finite-size program in infinite time and with infinite space. Just as for p~the difference being the absence of any computable radius of convergence~the first digits of omega are well known =-=[5]-=-, yet omega has been proved to be algorithmically incompressible and thus random. Nevertheless, presently, for all practical purposes, the statement that “the 10 101010 digit in a decimal expansion of... |

9 | Tasks and supertasks - Thomson - 1954 |

9 | Advertisement For a Paper I Like,” in On Limits - Landauer - 1994 |

8 | Modern Eleatics - Benacerraf, Tasks - 1962 |

8 |
Testing the randomness of quantum mechanics: Nature’s ultimate cryptogram
- Erber
(Show Context)
Citation Context ...ciple, be subject to the usual tests of stochasticity [37, 38]. Note that in quantum mechanics, the randomness of certain microphysical events, such as the spontaneous decay of excited quantum states =-=[39, 40]-=-, or the quantum coin toss experiments in complete context mismatches [37], is postulated as an axiom. This postulate is then used as the basis for the production of quantum randomness oracles such as... |