Randomness as an invariant for number representations

DOI10.1007/3-540-58131-6_37zbMath1529.68122OpenAlexW1506389137MaRDI QIDQ6142871

Helmut Jürgensen, Cristian S. Calude

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_37

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Algorithmic randomness and dimension (03D32)

Related Items

Liouville, computable, Borel normal and Martin-Löf random numbers, Feasible analysis, randomness, and base invariance

Cites Work

• Kolmogorov's contributions to information theory and algorithmic complexity
• Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity)
• Information-theoretic incompleteness
• Theories of computational complexity
• On the definition of normal numbers
• Ambiguity and decision problems concerning number systems
• Randomness conservation inequalities; information and independence in mathematical theories
• Every sequence is reducible to a random one
• Algorithmic Information Theory
• Exact Expressions for Some Randomness Tests
• The Construction of Decimals Normal in the Scale of Ten
• A combinatorial characterization of sequential p. martin-löf tests
• On the Length of Programs for Computing Finite Binary Sequences
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item