The Computational Power of Continuous Dynamic Systems
- Cite this paper as:
- Mycka J., Costa J.F. (2005) The Computational Power of Continuous Dynamic Systems. In: Margenstern M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg
In this paper we show how to explore the classical theory of computability using the tools of Analysis: a differential scheme is substituted for the classical recurrence scheme and a limit operator is substituted for the classical minimalization. We show that most relevant problems of computability over the non negative integers can be dealt with over the reals: elementary functions are computable, Turing machines can be simulated, the hierarchy of non computable functions be represented (being the classical halting problem solvable in some level). The most typical concepts in Analysis become natural in this framework.
Unable to display preview. Download preview PDF.