The case for hypercomputation

DOI10.1016/J.AMC.2005.09.067zbMath1101.68569OpenAlexW2151435594WikidataQ57691253 ScholiaQ57691253MaRDI QIDQ2497872

Mike Stannett

Publication date: 4 August 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.09.067

zbMATH Keywords

philosophy of mathematicshypercomputationmodels of computationnatural computationtemporal structuresuper-Turing machinetheory of computer science

Mathematics Subject Classification ID

Related Items (9)

Constructibility of the universal wave function ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ Relativistic computers and the Turing barrier ⋮ The computational status of physics ⋮ Expressive power of first-order recurrent neural networks determined by their attractor dynamics ⋮ CLOSED TIMELIKE CURVES IN RELATIVISTIC COMPUTATION ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics ⋮ Using Isabelle/HOL to verify first-order relativity theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum mechanical Hamiltonian models of Turing machines
• The wave equation with computable initial data such that its unique solution is not computable
• Cognition is not computation: The argument from irreversibility
• Analog computation via neural networks
• Recursion theory on the reals and continuous-time computation
• Superminds. People harness hypercomputation, and more
• Toward a theory of intelligence
• Hypercomputation with quantum adiabatic processes
• Super-tasks, accelerating Turing machines and uncomputability
• Natural computation and non-Turing models of computation
• The modal argument for hypercomputing minds
• Hypercomputation by definition
• The concept of computability
• Uncomputability: The problem of induction internalized
• Hypercomputation: Philosophical issues
• Analog computation with dynamical systems
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• On the computational power of neural nets
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• A computable ordinary differential equation which possesses no computable solution
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Hypercomputation and the Physical Church‐Turing Thesis
• Infinite time Turing machines
• Optimal simulation of automata by neural nets
• Deciding Arithmetic Using SAD Computers
• On the Possibility, or Otherwise, of Hypercomputation
• A refutation of Penrose's Gödelian case against artificial intelligence
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• The Diagonal Method and Hypercomputation
• Systems of Logic Based on Ordinals^†
• Mathematical Theory of the Differential Analyzer
• A logical calculus of the ideas immanent in nervous activity
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: The case for hypercomputation