Complexity, randomness, discretization: Some remarks on a program of J. Ford
✍ Scribed by Tyll Krüger; Serge Troubetzkoy
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 604 KB
- Volume
- 105
- Category
- Article
- ISSN
- 0167-2789
No coin nor oath required. For personal study only.
✦ Synopsis
We discuss certain aspects of the complexity of periodic orbits of chaotic dynamical systems in a symbolic setting. Our theory is based on a generalization of the notion of random sequences in the sense of Kolmogorov and Martin-L6f. Applying our results to the systems studied by Ford et al. leads to completely different conclusions.
📜 SIMILAR VOLUMES
In this paper we obtain some bounds for the expectation of the logarithm of the condition number of a random matrix whose elements are independent and identically distributed random variables. We also include some examples and extensions to cover the smoothed analysis as well as higher order moments