Randomness as an invariant for number representations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3868650 (Why is no real title available?)
- scientific article; zbMATH DE number 4103057 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3660616 (Why is no real title available?)
- scientific article; zbMATH DE number 3779306 (Why is no real title available?)
- scientific article; zbMATH DE number 93463 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 168432 (Why is no real title available?)
- scientific article; zbMATH DE number 3492569 (Why is no real title available?)
- scientific article; zbMATH DE number 3506818 (Why is no real title available?)
- scientific article; zbMATH DE number 3532844 (Why is no real title available?)
- scientific article; zbMATH DE number 4128138 (Why is no real title available?)
- scientific article; zbMATH DE number 736618 (Why is no real title available?)
- scientific article; zbMATH DE number 1142293 (Why is no real title available?)
- scientific article; zbMATH DE number 1995139 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3214063 (Why is no real title available?)
- A combinatorial characterization of sequential p. martin-löf tests
- Algorithmic Information Theory
- Ambiguity and decision problems concerning number systems
- Every sequence is reducible to a random one
- Exact Expressions for Some Randomness Tests
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Information-theoretic incompleteness
- Kolmogorov's contributions to information theory and algorithmic complexity
- On the Length of Programs for Computing Finite Binary Sequences
- On the definition of normal numbers
- Randomness conservation inequalities; information and independence in mathematical theories
- 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)
- The Construction of Decimals Normal in the Scale of Ten
- The definition of random sequences
- Theories of computational complexity
Cited in
(2)
This page was built for publication: Randomness as an invariant for number representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142871)