How much can analog and hybrid systems be proved (super-)Turing

DOI10.1016/J.AMC.2005.09.070MaRDI QIDQ2497875zbMATH OpenOpenAlexFDO

Authors Olivier Bournez

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

zbMATH Keywords

Church' thesis

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• The simple dynamics of super Turing theories
• An analogue-digital Church-Turing thesis
• scientific article; zbMATH DE number 5722781
• On the computational power of dynamical systems and hybrid systems
• Analog computation beyond the Turing limit

Cites work

• A computable ordinary differential equation which possesses no computable solution
• A dynamical system which must be stable whose stability cannot be proved
• Achilles and the tortoise climbing up the arithmetical hierarchy
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Analog computation beyond the Turing limit
• Analog computation via neural networks
• Church's thesis meets the \(N\)-body problem
• Classical physics and the Church--Turing Thesis
• Computability with low-dimensional dynamical systems
• Continuous-time computation with restricted integration capabilities
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• General recursive functions of natural numbers
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1424031 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Machines, Computations, and Universality
• New Computational Paradigms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the computational power of dynamical systems and hybrid systems
• On the computational power of neural nets
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Real recursive functions and their hierarchy
• Recursion theory on the reals and continuous-time computation
• Recursive function theory and numerical analysis
• Relativistic computers and the Turing barrier
• Some recent developments on Shannon's General Purpose Analog Computer
• The Church-Turing Thesis over Arbitrary Domains
• The complexity of analog computation
• The concept of computability
• The many forms of hypercomputation
• The wave equation with computable initial data such that its unique solution is not computable
• Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
• Unpredictability and undecidability in dynamical systems

Cited in

(9)

• On the computational power of dynamical systems and hybrid systems
• The simple dynamics of super Turing theories
• Embedding infinitely parallel computation in Newtonian kinematics
• Analog computation beyond the Turing limit
• scientific article; zbMATH DE number 1909824 (Why is no real title available?)
• A Survey on Analog Models of Computation
• New Computational Paradigms
• Welcoming the super Turing theories
• Hydrodynamic and symbolic models of computation with advice

This page was built for publication: How much can analog and hybrid systems be proved (super-)Turing

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