The complexity of analog computation
Mathematics and Computers in Simulation
Complexity theory of real functions
Complexity theory of real functions
Universal computation and other capabilities of hybrid and continuous dynamical systems
Theoretical Computer Science - Special issue on hybrid systems
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
Dynamical recognizers: real time language recognition by analog computers
Theoretical Computer Science
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science - Special issue on real numbers and computers
Analog computation with dynamical systems
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Computable analysis: an introduction
Computable analysis: an introduction
Iteration, inequalities, and differentiability in analog computers
Journal of Complexity
Ordinary Differential Equations
Ordinary Differential Equations
U.S. Technological Enthusiasm and British Technological Skepticism in the Age of the Analog Brain
IEEE Annals of the History of Computing
Subclasses of Coputable Real Valued Functions
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
The Computational Power of Continuous Time Neural Networks
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The Complexity of Real Recursive Functions
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Analog computers and recursive functions over the reals
Journal of Complexity
Continuous-time computation with restricted integration capabilities
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Real recursive functions and their hierarchy
Journal of Complexity
Elementarily computable functions over the real numbers and R-sub-recursive functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The P ≠ NP conjecture in the context of real and complex analysis
Journal of Complexity
The Methods of Approximation and Lifting in Real Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A note on discreteness and virtuality in analog computing
Theoretical Computer Science
Computability of analog networks
Theoretical Computer Science
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A new conceptual framework for analog computation
Theoretical Computer Science
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
The New Promise of Analog Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Characterizing Computable Analysis with Differential Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
The P≠NP conjecture in the context of real and complex analysis
Journal of Complexity
Using approximation to relate computational classes over the reals
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Polynomial time computation in the context of recursive analysis
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
A characterization of computable analysis on unbounded domains using differential equations
Information and Computation
Real recursive functions and real extensions of recursive functions
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The computational power of continuous dynamic systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A survey of recursive analysis and Moore's notion of real computation
Natural Computing: an international journal
Robust simulations of turing machines with analytic maps and flows
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Real Recursive Functions and Baire Classes
Fundamenta Informaticae
| Hi-index | 0.00 |
We study a restricted version of Shannon's general purpose analog computer in which we only allow the machine to solve linear differential equations. We show that if this computer is allowed to sense inequalities in a differentiable way, then it can compute exactly the elementary functions, the smallest known recursive class closed under time and space complexity. Furthermore, we show that if the machine has access to a function f(x) with a suitable growth as x goes to infinity, then it can compute functions on any given level of the Grzegorczyk hierarchy. More precisely, we show that the model contains exactly the nth level of the Grzegorczyk hierarchy if it is allowed to solve n - 3 non-linear differential equations of a certain kind. Therefore, we claim that, at least in this region of the complexity hierarchy, there is a close connection between analog complexity classes, the dynamical systems that compute them, and classical sets of subrecursive functions.