• Corpus ID: 1825

Hypercomputation: computing more than the Turing machine

@article{Ord2002HypercomputationCM,
  title={Hypercomputation: computing more than the Turing machine},
  author={Toby Ord},
  journal={ArXiv},
  year={2002},
  volume={math.LO/0209332}
}
  • Toby Ord
  • Published 25 September 2002
  • Computer Science
  • ArXiv
Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation that can compute more than the Turing machine and addresses their implications. In this report, I survey much of the work that has been done on hypercomputation, explaining how such non-classical models fit into the classical theory of computation and… 

Figures from this paper

Hypercomputation: Towards an extension of the classical notion of Computability?
TLDR
This thesis makes an analysis of the concept of Hypercomputation and of some hypermachines and attention is given to the possible physical realization of these machines and their usefulness.
Practical Intractability: A Critique of the Hypercomputation Movement
TLDR
This work presents a more mathematically concrete challenge to hypercomputability, and will show that one is immediately led into physical impossibilities, thereby demonstrating the infeasibility of hypercomputers more generally.
A hypercomputational alien
A hypercomputational alien q
TLDR
A conceptual framework for power comparison is proposed, by linking computational models to hypothetical physical devices, and some mathematical notions of relative computational power are deduced, allowing for the comparison of arbitrary models over arbitrary domains.
Transfinite Turing machines
TLDR
The construction of a new model of infinite computability is the key to understand and find algorithms that require an infinite number of steps to compute the solution.
The Diagonal Method and Hypercomputation
  • Toby OrdT. Kieu
  • Mathematics
    The British Journal for the Philosophy of Science
  • 2005
TLDR
It is demonstrated why a contradiction only occurs if a type of machine can compute its own diagonal function, and why such a situation does not occur for the methods of hypercomputation under attack, andwhy it is unlikely to occur for any other serious methods.
The physical and philosophical implications of the Church-Turing Thesis
This research project is an investigation into the physical and philosophical implications of the Church-Turing Thesis [CT], and its relationship to hypercomputation. This thesis has been subject to
A Hypercomputation in Brouwer's Constructivism
TLDR
This paper proposes a hypercomputation called persistently evolutionary Turing machines based on Brouwer's notion of being constructive, and refers to models of computation which go beyond Church-Turing thesis.
A tese de Church-Turing
TLDR
A brief introduction to the Turing thesis is made, and a commented partial translation of the relevant section of Turing's original 1936-37 article "On computable numbers, with an applica- tion to the Entscheidungsproblem" is included, where it is possible to understand how the Turing machine came to be.
...
...

References

SHOWING 1-10 OF 73 REFERENCES
The Broad Conception of Computation
TLDR
A myth has arisen concerning Turing's article of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine; this supposed principle is sometimes incorrectly termed the Church-Turing thesis.
A Formalisation of Non-Finite Computation
TLDR
It is proved that there is no satisfactory way to give a finite description for the machines, and the case of non-finite computation is used to arrive at an abstract principle of computation that is independent of physics.
The Turing machine paradigm in contemporary computing
TLDR
The work of Hartmanis, Stearns, Karp, Cook and others showed that the refinement of the theory to resource-bounded computations gave the means to explain the many intuitions concerning the complexity or ‘hardness’ of algorithmic problems in a precise and rigorous framework.
Non-Turing Computers and Non-Turing Computability
  • M. Hogarth
  • Computer Science
    PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association
  • 1994
TLDR
These new computers serve to show that Church's thesis is a thoroughly contingent claim, and since these new computers share the fundamental properties of a TM in ordinary operation, a computability theory based on these non-Turing computers is no less worthy of investigation than orthodox computation theory.
Non-Turing Computations Via Malament–Hogarth Space-Times
TLDR
It is argued that there are several distinguished Church–Turing-type theses (not only one) and validity of some of these theses depend on the background physical theory the authors choose to use, and if they choose classical general relativity theory as their background theory, then certain forms of the Church-Turing thesis cease to be valid.
Computing the noncomputable
  • T. Kieu
  • Mathematics, Computer Science
  • 2002
TLDR
It is argued that computability, and thus the limits of Mathematics, ought to be determined not solely by Mathematics itself but also by physical principles.
Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Physics, Philosophy
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible
Computation Beyond the Turing Limit
TLDR
A simply described but highly chaotic dynamical system called the analog shift map is presented here, which has computational power beyond the Turing limit (super-Turing); it computes exactly like neural networks and analog machines.
Coins, Quantum Measurements, and Turing's Barrier
TLDR
A mathematical quantum “device” (with sensitivity ε) is constructed to solve the Halting Problem and proves the Wiener measure of Fε, Tconstructively tends to zero when T tends to infinity.
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete
...
...