Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Algorithmic information theory
Algorithmic information theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Randomness and Determination, from Physics and Computing towards Biology
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
| Hi-index | 0.00 |
This paper presents a short survey of some recent approaches relating two different areas, viz. deterministic chaos and computability. Chaos in classical physics may be approached by dynamical (equationally determined) systems or stochastic ones (as random processes). However, randomness has also been effectively modelled using recursion theoretic tools by P. Martin-Löf. We recall its connections to Kolmogorov complexity and show some applications to dynamical systems. This allows us to introduce results that connect well-established notions of entropy and algorithmic information.