Some bounds on the computational power of piecewise constant derivative systems (extended abstract)

DOI10.1007/3-540-63165-8_172zbMath1401.68076OpenAlexW1599475026MaRDI QIDQ4571947

Olivier Bournez

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_172

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Hierarchies of computability and definability (03D55)

Related Items

Computing with polynomial ordinary differential equations, Abstract geometrical computation. VIII: Small machines, accumulations \& rationality, Achilles and the tortoise climbing up the arithmetical hierarchy

Cites Work

• Unnamed Item
• Universal computation and other capabilities of hybrid and continuous 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
• On some relations between dynamical systems and transition systems
• Achilles and the tortoise climbing up the arithmetical hierarchy