constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
A concept of computation assuming computable operations more powerful than in traditional computability (more powerful than partial recursive functions? and computable functions in computable analysis).
For instance a Turing machine that could not just run forever, but actually process an infinite number of steps “in finite time” would be a hypercomputer. Bauer provides a realizability topos for infinite time computation; see also Hamkins.
It has been argued that there are spacetimes – see at Malament–Hogarth spacetime – which are such that they allow trajectories on which a computer could travel indefinitely together with spacetime points at which an observer could observe the whole infinite history of the computer in finite time. If this indeed were physically realizable it would to some extent contradict the physical Church-Turing thesis, which asserts that no physical process can realize a computer more powerful than a Turing machine.
Wikipedia, Hypercomputation
Stanford Encyclopedia of Philosophy, section 4.3 of Computation in Physical Systems
discussion Can somebody explain this to me?: The computability of the laws of physics and hypercomputation
Last revised on September 15, 2019 at 01:15:37. See the history of this page for a list of all contributions to it.