Achilles and the tortoise climbing up the arithmetical hierarchy

DOI10.1006/JCSS.1998.1601zbMath0928.68128OpenAlexW1993678874MaRDI QIDQ5906326

Oded Maler, Eugene Asarin

Publication date: 26 April 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1601

zbMATH Keywords

hybrid dynamical systemsreachability problem

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Related Items (8)

Computability and Dynamical Systems ⋮ Computation with perturbed dynamical systems ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ Classes of Timed Automata and the Undecidability of Universality ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions ⋮ A Survey on Analog Models of Computation

Cites Work

• The algorithmic analysis of hybrid systems
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
• Unnamed Item
• Unnamed Item

This page was built for publication: Achilles and the tortoise climbing up the arithmetical hierarchy