Effectively closed sets of measures and randomness
From MaRDI portal
Publication:958494
DOI10.1016/j.apal.2008.06.015zbMath1153.03021arXiv0804.2656OpenAlexW2084384146MaRDI QIDQ958494
Publication date: 5 December 2008
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.2656
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Hausdorff and packing measures (28A78)
Related Items
Energy randomness, UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS, Randomness, Computation and Mathematics, Dimension spectra of lines1, On zeros of Martin-Löf random Brownian motion, Propagation of partial randomness, Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension, Schnorr randomness for noncomputable measures, Fixed point theorems on partial randomness, Turing degrees and randomness for continuous measures, Absolutely no free lunches!, Fractal Intersections and Products via Algorithmic Dimension, Randomness for computable measures and initial segment complexity, Members of Random Closed Sets, Dimension spectra of lines, Prequential randomness and probability, Fixed Point Theorems on Partial Randomness, Effectively closed subgroups of the infinite symmetric group, Martin-Löf randomness and Galton-Watson processes, Randomness for non-computable measures, Measures and their random reals, Cone avoidance and randomness preservation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite subsets of random sets of integers
- Descriptive set theory
- The dimensions of individual strings and sequences
- Uniform test of algorithmic randomness over a general space
- On partial randomness
- Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics
- Kolmogorov complexity and the Recursion Theorem
- Algorithmic Randomness and Complexity
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Effective packing dimension of $\Pi ^0_1$-classes
- Members of Random Closed Sets
- Randomness conservation inequalities; information and independence in mathematical theories
- Every sequence is reducible to a random one
- Strong and weak duality principles for fractal dimension in Euclidean space
- Diagonally non-recursive functions and effective Hausdorff dimension
- Measures and their random reals
- Degrees of unsolvability of continuous functions
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
