Functions that preserve p-randomness
From MaRDI portal
Publication:393087
DOI10.1016/j.ic.2013.08.009zbMath1358.03059arXiv1202.6395MaRDI QIDQ393087
Publication date: 16 January 2014
Published in: Information and Computation, Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.6395
complexity; computational complexity; measure; martingale; randomness; p-randomness; polynomial-time randomness
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D32: Algorithmic randomness and dimension
03D78: Computation over the reals, computable analysis
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Functions that preserve p-randomness
- On normal numbers
- Entropy rates and finite-state dimension
- Almost everywhere high nonuniform complexity
- Resource bounded randomness and weakly complete problems
- Resource bounded randomness and computational complexity
- Finite-state dimension and real arithmetic
- Endliche Automaten und Zufallsfolgen
- Algorithmic Randomness and Complexity
- On a problem of Steinhaus about normal numbers
- Calibrating Randomness
- Category and Measure in Complexity Classes
- Connectivity properties of dimension level sets
- Dimensions of Points in Self-Similar Fractals
- Equivalence of Measures of Complexity Classes
- The definition of random sequences
