Complexity, randomness, discretization: some remarks on a program of J. Ford

DOI10.1016/S0167-2789(96)00243-6zbMath0933.37048MaRDI QIDQ1963281

Serge E. Troubetzkoy, Tyll Krueger

Publication date: 24 January 2000

Published in: Physica D (Search for Journal in Brave)

zbMATH Keywords

periodic orbitschaotic dynamical systemssymbolic setting

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Generation, random and stochastic difference and differential equations (37H10) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Symbolic dynamics (37B10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

PSEUDO-RANDOMNESS OF ROUND-OFF ERRORS IN DISCRETIZED LINEAR MAPS ON THE PLANE, An algorithmic view of pseudochaos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Arnol'd cat: Failure of the correspondence principle
• Can an individual sequence of zeros and ones be random?
• Algorithmic complexity of points in dynamical systems