Hypercomputation
From MaRDI portal
Publication:3499278
DOI10.1007/978-0-387-49970-3zbMath1162.68014MaRDI QIDQ3499278
Publication date: 29 May 2008
Full work available at URL: https://doi.org/10.1007/978-0-387-49970-3
effectiveness; computability theory; interactive computing; models of hypercomputation; recursive function theory; natural computation; infinite-time Turing machines; noncomputability; coupled Turing machines; inductive Turing machines; infinite-time automata; pseudo-recursiveness; quantum hypercomputation; Type-2 Theory; Zeus machines
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, The Significance of Relativistic Computation for the Philosophy of Mathematics, A Survey on Analog Models of Computation, What is the Church-Turing Thesis?, Logic and Complexity in Cognitive Science, On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus, Undecidability through Fourier series, Recursive analysis of singular ordinary differential equations, A dozen of research topics in membrane computing, On TAE machines and their computational power, Machines that perform measurements, THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION', Some Transfinite Generalisations of Gödel’s Incompleteness Theorem, Towards “Fypercomputations” (in Membrane Computing), Unconventional Computing: Do We Dream Too Much?
