Physical constraints on hypercomputation

DOI10.1016/J.TCS.2007.12.009MaRDI QIDQ2482458zbMATH OpenOpenAlexFDO

Authors Paul Cockshott, Greg Michaelson, L. M. Mackenzie

Publication date 16 April 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.12.009

zbMATH Keywords

computabilityhyper-computingquantum-computingquantum-measurement

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum computation (81P68)

Recommendations

• Hypercomputation and the Physical Church‐Turing Thesis
• scientific article; zbMATH DE number 1909825
• Logical Approaches to Computational Barriers
• Hypercomputation: Philosophical issues
• The case for hypercomputation

Cites work

• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• Church's thesis meets the \(N\)-body problem
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Computability of analog networks
• Embedding infinitely parallel computation in Newtonian kinematics
• General recursive functions of natural numbers
• scientific article; zbMATH DE number 3860368 (Why is no real title available?)
• scientific article; zbMATH DE number 1517411 (Why is no real title available?)
• scientific article; zbMATH DE number 1869997 (Why is no real title available?)
• scientific article; zbMATH DE number 1909830 (Why is no real title available?)
• scientific article; zbMATH DE number 872244 (Why is no real title available?)
• scientific article; zbMATH DE number 3291234 (Why is no real title available?)
• scientific article; zbMATH DE number 3194126 (Why is no real title available?)
• scientific article; zbMATH DE number 3111469 (Why is no real title available?)
• Irreversibility and Heat Generation in the Computing Process
• Logical Approaches to Computational Barriers
• Logical Approaches to Computational Barriers
• Marx, Mao and mathematics: The politics of infinitesimals
• New Models of Computation
• Non-Turing computations via Malament--Hogarth space-times
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the computational power of dynamical systems and hybrid systems
• Quantum algorithm for Hilbert's tenth problem
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Systems of Logic Based on Ordinals^†
• Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks

Cited in

(19)

• How to build a hypercomputer
• Physical computation and first-order logic
• The case for hypercomputation
• A hypercomputational alien
• Definability as hypercomputational effect
• Some thoughts on hypercomputation
• Computational power of infinite quantum parallelism
• Machines that perform measurements
• Hyperloops do not threaten the notion of an effective procedure
• Hypercomputation and the Physical Church‐Turing Thesis
• Blueprint for a hypercomputer
• Is feasibility in physics limited by fantasy alone?
• A Survey on Analog Models of Computation
• What is the Church-Turing Thesis?
• Computation and its limits.
• The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem
• The Diagonal Method and Hypercomputation
• Logical Approaches to Computational Barriers
• X-machines and the halting problem: Building a super-turing machine

This page was built for publication: Physical constraints on hypercomputation

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