Trivial measures are not so trivial

DOI10.1007/S00224-015-9614-8zbMath1330.03079arXiv1503.06332OpenAlexW2003864541MaRDI QIDQ2354580

Christopher P. Porter

Publication date: 20 July 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.06332

zbMATH Keywords

computability theoryalgorithmic randomnesstrivial measurescomputable probability measures

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (3)

Randomness for computable measures and initial segment complexity ⋮ RANK AND RANDOMNESS ⋮ Randomness and initial segment complexity for measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong reductions in effective randomness
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Lowness properties and randomness
• Algorithmic Randomness and Complexity
• Lowness and nullsets
• The axiomatization of 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
• Randomness, relativization and Turing degrees

This page was built for publication: Trivial measures are not so trivial