Computability and information in models of randomness and chaos

DOI10.1017/S0960129508006646zbMATH Open1141.68035MaRDI QIDQ5458068FDOQ5458068

Authors: Cristobal Rojas 

Publication date: 10 April 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• On randomness, determinism and computability
• scientific article; zbMATH DE number 521942
• Randomness, computation and mathematics
• Kolmogorov complexity in perspective. I: Information theory and randomness
• Algorithmic chaos and the incompressibility method

zbMATH Keywords

entropyalgorithmic information

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Title not available (Why is that?)
• Proof of the Ergodic Theorem
• Combinatorial foundations of information theory and the calculus of probabilities
• Algorithmic Information Theory
• Title not available (Why is that?)
• The definition of random sequences
• Randomness conservation inequalities; information and independence in mathematical theories
• Orbit complexity by computable structures
• Pointwise information entropy for metric spaces

Cited In (8)

• The algorithmic information content for randomly perturbed systems
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Algorithmic chaos and the incompressibility method
• Title not available (Why is that?)
• Randomness and Determination, from Physics and Computing towards Biology
• Causal nets for geometrical Gandy-Păun-Rozenberg machines
• Computability of entropy and information in classical Hamiltonian systems
• Sporadicity: Between periodic and chaotic dynamical behaviors

This page was built for publication: Computability and information in models of randomness and chaos

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