Trivial measures are not so trivial

DOI10.1007/S00224-015-9614-8zbMATH Open1330.03079arXiv1503.06332OpenAlexW2003864541MaRDI QIDQ2354580FDOQ2354580

Authors: Christopher P. Porter 

Publication date: 20 July 2015

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

Abstract: Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to computable emph{trivial} measures, where a measure $mu$ on $2^{o}mega$ is trivial if the support of $mu$ consists of a countable collection of sequences. In this article, it is shown that there is much more structure to trivial computable measures than has been previously suspected.

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

Recommendations

• Sur les dimensions de mesures
• scientific article; zbMATH DE number 3862123
• Trivial Jensen measures without regularity
• scientific article
• A note on the measure problem
• On Almost Shadowable Measures
• On the notion of measurability
• A note on complete nonmeasurability
• scientific article; zbMATH DE number 4077610
• On Minkowski measurability

zbMATH Keywords

algorithmic randomnesscomputability theorytrivial measurescomputable probability measures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Algorithmic randomness and complexity.
• Computability and randomness
• Title not available (Why is that?)
• 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
• Lowness properties and randomness
• Randomness, relativization and Turing degrees
• 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 and nullsets
• The axiomatization of randomness

Cited In (5)

• Randomness and initial segment complexity for measures
• Randomness for non-computable measures
• Title not available (Why is that?)
• Randomness for computable measures and initial segment complexity
• RANK AND RANDOMNESS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354580)