The many forms of hypercomputation

DOI10.1016/j.amc.2005.09.076zbMath1096.68054OpenAlexW2104877614MaRDI QIDQ2497883

Toby Ord

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.076

zbMATH Keywords

randomnesshypercomputationoraclesinfinite-time Turing machineaccelerating Turing machine

Mathematics Subject Classification ID

Related Items (9)

A dozen of research topics in membrane computing ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Output concepts for accelerated Turing machines ⋮ Perfect nonlinear S-boxes on the real-line ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ Relativistic computers and the Turing barrier ⋮ Computability on reals, infinite limits and differential equations ⋮ Expressive power of first-order recurrent neural networks determined by their attractor dynamics ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analog computation via neural networks
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• Computational Complexity of Probabilistic Turing Machines
• Building Infinite Machines
• Turing's O-machines, Searle, Penrose and the brain
• Infinite time Turing machines
• On the Possibility, or Otherwise, of Hypercomputation
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On Non-Computable Functions
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• An Unsolvable Problem of Elementary Number Theory
• Recursive Predicates and Quantifiers
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: The many forms of hypercomputation