The many forms of hypercomputation

DOI10.1016/J.AMC.2005.09.076zbMATH Open1096.68054OpenAlexW2104877614MaRDI QIDQ2497883FDOQ2497883

Authors: 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

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Cites Work

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

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497883)