THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'

DOI10.1142/S0129626412400129zbMath1294.68080MaRDI QIDQ2842654

Selmer Bringsjord, Naveen Sundar Govindarajulu

Publication date: 16 August 2013

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

hypercomputationMartin Davismyth of the myth

Mathematics Subject Classification ID

Related Items (1)

``Viral Turing machines, computation from noise and combinatorial hierarchies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate reasoning in the algebra of bounded rational agents
• The existence of noncollision singularities in Newtonian systems
• Analog computation via neural networks
• The modal argument for hypercomputing minds
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• Why there is no such discipline as hypercomputation
• The case for hypercomputation
• The many forms of hypercomputation
• Super-Recursive Algorithms
• Hypercomputation
• An Introduction to Gödel's Theorems
• Infinite time Turing machines
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• Language identification in the limit

This page was built for publication: THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'