A computational model going beyond Turing machines was introduced by Alan Turing in his 1938 PhD dissertation Systems of Logic Based on Ordinals. This paper investigated … 展开

In a sense, most functions are uncomputable: there are $${\displaystyle \aleph _{0}}$$ computable functions, but there are an uncountable number ($${\displaystyle 2^{\aleph _{0}}}$$) of possible super-Turing functions. 展开

Martin Davis, in his writings on hypercomputation, refers to this subject as "a myth" and offers counter-arguments to the physical realizability of … 展开

• Aoun, Mario Antoine (2016). "Advances in Three Hypercomputation Models" (PDF). Electronic Journal of Theoretical Physics. 13 (36): … 展开

Hypercomputer models range from useful but probably unrealizable (such as Turing's original oracle machines), to less-useful random-function … 展开

Many hypercomputation proposals amount to alternative ways to read an oracle or advice function embedded into an otherwise classical … 展开

• Digital physics
• Limits of computation 展开