Randomness and initial segment complexity for measures
From MaRDI portal
Publication:2062126
DOI10.1016/j.tcs.2021.11.003OpenAlexW3217275172MaRDI QIDQ2062126
Publication date: 22 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.07871
Related Items (1)
Cites Work
- Relating and contrasting plain and prefix Kolmogorov complexity
- Oscillation in the initial segment complexity of random reals
- Upcrossing inequalities for stationary sequences and applications
- The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
- Classical recursion theory. The theory of functions and sets of natural numbers
- Information-theoretic characterizations of recursive infinite strings
- Randomly generated distributions
- Randomness and initial segment complexity for measures
- Process complexity and effective random tests
- Trivial measures are not so trivial
- Computability of probability measures and Martin-Löf randomness over metric spaces
- The dimension of ergodic random sequences
- Algorithmic Randomness and Complexity
- On initial segment complexity and degrees of randomness
- A Theory of Program Size Formally Identical to Information Theory
- Complexity dips in random infinite binary sequences
- Martin-Löf random quantum states
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
- The definition of random sequences
- Randomness, relativization and Turing degrees
- Quantum algorithmic randomness
- An introduction to Kolmogorov complexity and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Randomness and initial segment complexity for measures
