Some recent developments on Shannon's General Purpose Analog Computer
From MaRDI portal
Recommendations
Cited in
(21)- Computational bounds on polynomial differential equations
- Some mathematical limitations of the general-purpose analog computer
- On the functions generated by the general purpose analog computer
- A survey of recursive analysis and Moore's notion of real computation
- Polynomial differential equations compute all real computable functions on computable compact intervals
- How much can analog and hybrid systems be proved (super-)Turing
- Computing with polynomial ordinary differential equations
- Characterizing Computable Analysis with Differential Equations
- Turing machines can be efficiently simulated by the general purpose analog computer
- A Survey on Analog Models of Computation
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Anti-heterotic computing
- Characterizing time computational complexity classes with polynomial differential equations
- Theory and Applications of Models of Computation
- Iteration, inequalities, and differentiability in analog computers
- Special issue: In memoriam Claude Shannon (1916-2001)
- A continuous characterization of PSPACE using polynomial ordinary differential equations
- Theoretical computer science: computability, decidability and logic
- A note on discreteness and virtuality in analog computing
- The elementary computable functions over the real numbers: applying two new techniques
- The nature of the extended analog computer
This page was built for publication: Some recent developments on Shannon's General Purpose Analog Computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159432)