Random generation of finite Sturmian words
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Complexity and information
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Hi-index | 0.00 |
We study computability of real-valued functions and the information needed for simulation of dynamical systems. In particular, we describe application of Kolmogorov complexity theory to computer simulation of irrational rotations in a single neuron model. We deduce the information needed for a parameter in simulating the dynamics by showing a difference in Kolmogorov complexity between a computable parameter and a non-computable parameter. Finally, we show that all trajectories generated by irrational rotations are non-computable iff its parameter is non-computable.