Complexity, randomness, discretization: some remarks on a program of J. Ford
DOI10.1016/S0167-2789(96)00243-6zbMATH Open0933.37048MaRDI QIDQ1963281FDOQ1963281
Authors: Tyll Krueger, Serge Troubetzkoy
Publication date: 24 January 2000
Published in: Physica D (Search for Journal in Brave)
Recommendations
- Stochastic and deterministic characteristics of orbits in chaotically looking dynamical systems
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Chaos, periodicity and complexity on dynamical systems
- scientific article; zbMATH DE number 4089442
- FROM SYMBOLIC DYNAMICS TO A DIGITAL APPROACH
Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Symbolic dynamics (37B10) Generation, random and stochastic difference and differential equations (37H10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Can an individual sequence of zeros and ones be random?
- The Arnol'd cat: Failure of the correspondence principle
- Algorithmic complexity of points in dynamical systems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Complexity, randomness, discretization: some remarks on a program of J. Ford
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963281)