The many forms of hypercomputation

DOI10.1016/J.AMC.2005.09.076MaRDI QIDQ2497883zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 1189126 (Why is no real title available?)
• scientific article; zbMATH DE number 3586965 (Why is no real title available?)
• scientific article; zbMATH DE number 1233702 (Why is no real title available?)
• scientific article; zbMATH DE number 976939 (Why is no real title available?)
• scientific article; zbMATH DE number 1993590 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1869997 (Why is no real title available?)
• scientific article; zbMATH DE number 1909824 (Why is no real title available?)
• scientific article; zbMATH DE number 1909827 (Why is no real title available?)
• scientific article; zbMATH DE number 1909830 (Why is no real title available?)
• scientific article; zbMATH DE number 1909831 (Why is no real title available?)
• scientific article; zbMATH DE number 1909832 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• An Unsolvable Problem of Elementary Number Theory
• Analog computation via neural networks
• Building Infinite Machines
• Computational Complexity of Probabilistic Turing Machines
• Infinite time Turing machines
• Limiting recursion
• Non-Turing computations via Malament--Hogarth space-times
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On non-computable functions
• On the Possibility, or Otherwise, of Hypercomputation
• Recursive Predicates and Quantifiers
• Trial and error predicates and the solution to a problem of Mostowski
• Turing's O-machines, Searle, Penrose and the brain

Cited in

(10)

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

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)