Process and truth-table characterisations of randomness
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4053595 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 1072536 (Why is no real title available?)
- scientific article; zbMATH DE number 969633 (Why is no real title available?)
- scientific article; zbMATH DE number 3238610 (Why is no real title available?)
- A formal theory of inductive inference. Part II
- A unified approach to the definition of random sequences
- Algorithmic randomness and complexity.
- Computability and randomness
- On Kurtz randomness
- On process complexity
- On the Length of Programs for Computing Finite Binary Sequences
- Process complexity and effective random tests
- Schnorr randomness
- Strong reductions in effective randomness
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
This page was built for publication: Process and truth-table characterisations of randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714787)