How much can analog and hybrid systems be proved (super-)Turing
From MaRDI portal
Publication:2497875
DOI10.1016/j.amc.2005.09.070zbMath1104.68046OpenAlexW2119244842MaRDI QIDQ2497875
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
Related Items
Embedding infinitely parallel computation in Newtonian kinematics, A Survey on Analog Models of Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamical system which must be stable whose stability cannot be proved
- Real recursive functions and their hierarchy
- The complexity of analog computation
- The wave equation with computable initial data such that its unique solution is not computable
- Recursive function theory and numerical analysis
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Analog computation via neural networks
- Computability with low-dimensional dynamical systems
- On the computational power of dynamical systems and hybrid systems
- Recursion theory on the reals and continuous-time computation
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Continuous-time computation with restricted integration capabilities
- The concept of computability
- On the computational power of neural nets
- Analog computation beyond the Turing limit
- Relativistic computers and the Turing barrier
- The many forms of hypercomputation
- Church's thesis meets the \(N\)-body problem
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- General recursive functions of natural numbers
- Some recent developments on Shannon's General Purpose Analog Computer
- Classical physics and the Church--Turing Thesis
- A computable ordinary differential equation which possesses no computable solution
- Unpredictability and undecidability in dynamical systems
- The Church-Turing Thesis over Arbitrary Domains
- Machines, Computations, and Universality
- New Computational Paradigms
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Achilles and the tortoise climbing up the arithmetical hierarchy
