scientific article; zbMATH DE number 1869997
From MaRDI portal
Publication:4792712
DOI10.1023/A:1015607401307zbMath1034.03502OpenAlexW1852397043MaRDI QIDQ4792712
Publication date: 17 February 2003
Published in: Minds and Machines (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015607401307
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decision problemhalting problemChurch-Turing thesishypercomputationeffective procedurehypercomputeroracle machineaccelerating Turing machinesuper-taskChinese room argument\(\pi\)-machineinfinity machine
Philosophical and critical aspects of logic and foundations (03A05) General topics in artificial intelligence (68T01) Turing machines and related notions (03D10)
Related Items
Computing with polynomial ordinary differential equations ⋮ What is the Church-Turing Thesis? ⋮ Computation as an unbounded process ⋮ Super-tasks, accelerating Turing machines and uncomputability ⋮ The concept of computability ⋮ Hypercomputation: Philosophical issues ⋮ Ideal negative conceivability and the halting problem ⋮ Physical constraints on hypercomputation ⋮ Supertasks do not increase computational power ⋮ Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer ⋮ The Church-Turing thesis: Still valid after all these years? ⋮ The many forms of hypercomputation ⋮ Zeno machines and hypercomputation ⋮ A note on accelerated Turing machines ⋮ Accelerating machines: a review ⋮ Sharvy's Lucy and Benjamin puzzle ⋮ Multi-Resolution Cellular Automata for Real Computation ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics ⋮ A Survey on Analog Models of Computation
