Computability and information in models of randomness and chaos

DOI10.1017/S0960129508006646zbMath1141.68035MaRDI QIDQ5458068

Cristobal Rojas

Publication date: 10 April 2008

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

zbMATH Keywords

entropyalgorithmic information

Mathematics Subject Classification ID

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

Related Items (2)

Volume and Entropy of Regular Timed Languages: Discretization Approach ⋮ Randomness and Determination, from Physics and Computing towards Biology

Cites Work

• Unnamed Item
• Unnamed Item
• Randomness conservation inequalities; information and independence in mathematical theories
• Combinatorial foundations of information theory and the calculus of probabilities
• Algorithmic Information Theory
• Proof of the Ergodic Theorem
• Orbit complexity by computable structures
• Pointwise information entropy for metric spaces
• The definition of random sequences

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