Hypercomputation

DOI10.1007/978-0-387-49970-3zbMath1162.68014OpenAlexW4243683594MaRDI QIDQ3499278

Apostolos Syropoulos

Publication date: 29 May 2008

Full work available at URL: https://doi.org/10.1007/978-0-387-49970-3

zbMATH Keywords

effectivenesscomputability theoryinteractive computingmodels of hypercomputationrecursive function theorynatural computationinfinite-time Turing machinesnoncomputabilitycoupled Turing machinesinductive Turing machinesinfinite-time automatapseudo-recursivenessquantum hypercomputationType-2 TheoryZeus machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (15)

Undecidability through Fourier series ⋮ Some Transfinite Generalisations of Gödel’s Incompleteness Theorem ⋮ Towards “Fypercomputations” (in Membrane Computing) ⋮ What is the Church-Turing Thesis? ⋮ A dozen of research topics in membrane computing ⋮ Unconventional Computing: Do We Dream Too Much? ⋮ Machines that perform measurements ⋮ On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus ⋮ Recursive analysis of singular ordinary differential equations ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' ⋮ Logic and Complexity in Cognitive Science ⋮ On TAE machines and their computational power ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics ⋮ A Survey on Analog Models of Computation

This page was built for publication: Hypercomputation