Some bounds on the computational power of piecewise constant derivative systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 143-153

  Bournez, Olivier ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIFFERENTIAL EQUATIONS; DYNAMICAL SYSTEMS;

ARITHMETICAL HIERARCHY; COMPUTATION TIME; COMPUTATIONAL POWER; CONTINUOUS SPACES; CONTINUOUS VALUE; CONTINUOUS-TIME; DISCRETE VALUES; PIECE-WISE CONSTANTS;

CONTINUOUS TIME SYSTEMS;

EID: 0039711165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_172     Document Type: Conference Paper

References (8)

1. Eugene Aşarin and Oded Maler. On some Relations between Dynamical Systems and Transition Systems. In Proceedings of ICALP, pages 59-72, 1994. Lecture Notes in Computer Science, 820.
2. Eugene Aşarin and Oded Maler. Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy. In Proceedings of FSTTGS, pages 471-483, 1995. Lecture Notes in Computer Science, 1026.
3. Eugene Aşarin, Oded Maler, and Amir Pnueli. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138:33-65, 1995.
4. Olivier Bournez and Michel Cosnard. On the computational power of hybrid and dynamical systems. Theoretical Computer Science, 168(2):417-459, 1996.
5. Michael S. Branicky. Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoretical Computer Science, 138:67-100, 1995.
6. Cristopher Moore. Recursion theory on the reals and continuous-time computation. Theoretical Computer Science, 162:23-44, 1996.
7. P. Odifreddi. Classical Recursion Theory, volume 125 of Studies in Logic and the foundations of mathematics. Elsevier, 1992.
8. H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.