On the functions generated by the general purpose analog computer
From MaRDI portal
Publication:1680506
DOI10.1016/j.ic.2017.09.015zbMath1380.68176arXiv1602.00546OpenAlexW2963598527MaRDI QIDQ1680506
Amaury Pouly, Olivier Bournez, Daniel Silva Graça
Publication date: 16 November 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00546
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Characterizing time computational complexity classes with polynomial differential equations ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ A Universal Ordinary Differential Equation ⋮ A Survey on Analog Models of Computation
Cites Work
- Computing with polynomial ordinary differential equations
- Analog computers and recursive functions over the reals.
- A short proof of the generalized Faà di Bruno's formula
- The differential analyzer. A new machine for solving differential equations
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Higher chain formula proved by combinatorics
- Some recent developments on Shannon's General Purpose Analog Computer
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- On the complexity of solving initial value problems
- Mathematical Theory of the Differential Analyzer
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the functions generated by the general purpose analog computer