Algorithmic chaos and the incompressibility method

MaRDI QIDQ3508021zbMATH OpenFDO

Authors Paul M. B. Vitányi

Publication date 27 June 2008

Full work available at URL https://link.springer.com/chapter/10.1007/978-3-540-36351-4_15

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Ergodic theory (37A99) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Combinatorial probability (60C05)

Recommendations

• Computability and information in models of randomness and chaos
• Kolmogorov complexity and chaotic phenomena
• scientific article; zbMATH DE number 4089442
• On randomness, determinism and computability
• Randomness conservation inequalities; information and independence in mathematical theories

Cited in

(5)

• Unconventional algorithms and hidden chaotic attractors
• Method of algorithmic transformations with applications to chaotic systems
• Kolmogorov complexity and chaotic phenomena
• Computability and information in models of randomness and chaos
• scientific article; zbMATH DE number 5046283 (Why is no real title available?)

This page was built for publication: Algorithmic chaos and the incompressibility method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508021)