Undecidable event detection problems for odes of dimension one and two

Theoretical Informatics and Applications

Volumn 31, Issue 1, 1997, Pages 67-79

  Ruohonen, Keijo ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 5644267120     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1997310100671     Document Type: Article

References (16)

1. C. H. BENNETT, Logical Reversibility of Computation. IBM J. Res. Dev. 17, 1973. pp. 525-523.
2. P. HARTMAN, Ordinary Differential Equations. Birkhäuser, 1982.
3. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
4. P. KOIRAN, P. COSNARD and M. GARZON, Computability with Low-Dimensional Dynamical Systems. Theoret. Camput. Sci. 132, 1994, pp. 113-128.
5. C. MOORE. Unpredictability and Undecidability in Dynamical Systems. Phys. Rev. Lett. 64, 1990, pp. 2354-2357.
6. C. MOORE, Generalized Shifts: Unpredictability and Undecidability in Dynamical Systems. Nonlinearity 4, 1991, pp. 199-230.
7. n, où θ est un "isomorphisme de codes". Comptes Rendus 257. 1963, pp. 2597-2600.
8. M. B. POUR-EL and I. RICHARDS, A Computable Ordinary Differential Equation which Possesses No Computable Solutions. Ann. Math. Logic 17, 1979, pp. 61-90.
9. M. B. POUR-EL, and I. RICHARDS, Computability in Analysis and Physics. Springer-Verlag, 1989.
10. E. O. ROXIN, Ordinary Differential Equations. Wadsworth, 1972.
11. K. RUOHONEM, Undecidability of Event Detection for ODEs. J. Inform. Proc. Cybern. EIK, 29, 1993, pp. 101-113.
12. K. RUOHONEN, Event Detection and Nonrecursive Hierarchies. Results and Trends in Theoretical Computer Science (J. Karhumäki, H. Maurer and G. Rozenberg, Eds.). Lecture Notes in Computer Science 812. Springer-Verlag, 1994, pp. 358-371.
13. K. RUOHONEN, Decidability and Complexity of Event Detection Problems for ODEs. To appear in Complexity.
14. K. RUOHONEN, Reversible Machines and Post's Correspondence Problem for Biprefix Morphisms. Elektron. Inf.verarb. Kybern. EIK 27, 1985, pp. 579-595.
15. L. F. SHAMPINE, I. GLADWELL and R. W. BRANKIN, Reliable Solution of Special Event Location Problems for ODEs. ACM Trans. Math. Software 17, 1991, pp. 11-25.
16. H. T. SIEGELMANN, Computation Beyond the Turing Limit. Science 268, 1995, pp. 545-548.