Analog computation beyond the Turing limit
From MaRDI portal
Publication:2497879
DOI10.1016/j.amc.2005.09.074zbMath1110.68045OpenAlexW2169148760MaRDI QIDQ2497879
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.074
Related Items
Simulation of Turing machine with uEAC-computable functions, Embedding infinitely parallel computation in Newtonian kinematics, How much can analog and hybrid systems be proved (super-)Turing, Relativistic computers and the Turing barrier, Abstract geometrical computation. III: Black holes for classical and analog computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Real recursive functions and their hierarchy
- Some mathematical limitations of the general-purpose analog computer
- Undecidability and incompleteness in classical mechanics
- The existence of noncollision singularities in Newtonian systems
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Classical recursion theory. Vol. II
- Analog computation via neural networks
- Small universal Turing machines
- Recursion theory on the reals and continuous-time computation
- \(\mu\)-recursion and infinite limits.
- The extended analog computer
- An analog characterization of the Grzegorczyk hierarchy
- The P\(\neq\) NP conjecture in the context of real and complex analysis
- The Arithmetical Hierarchy of Real Numbers
- On the definitions of computable real continuous functions
- Undecidability over Continuous Time
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Digital simulation of analog computation and Church's thesis
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Automata, Languages and Programming
- Machines, Computations, and Universality
- Mathematical Theory of the Differential Analyzer
- Non-Turing computations via Malament--Hogarth space-times
