Strong reductions in effective randomness
From MaRDI portal
Publication:1758164
DOI10.1016/J.TCS.2012.06.031zbMath1283.68170OpenAlexW2066889014MaRDI QIDQ1758164
Laurent Bienvenu, Christopher P. Porter
Publication date: 8 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.031
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (16)
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs ⋮ When does randomness come from randomness? ⋮ PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ Algorithmically Random Functions and Effective Capacities ⋮ DEEP CLASSES ⋮ Schnorr randomness for noncomputable measures ⋮ On effectively closed sets of effective strong measure zero ⋮ Randomness for computable measures and initial segment complexity ⋮ Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness ⋮ Process and truth-table characterisations of randomness ⋮ DEMUTH’S PATH TO RANDOMNESS ⋮ Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness ⋮ RANK AND RANDOMNESS ⋮ Computable randomness and betting for computable probability spaces ⋮ Effective randomness for continuous measures ⋮ Trivial measures are not so trivial
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparing notions of randomness
- Constructive equivalence relations on computable probability measures
- Mathematical metaphysics of randomness
- Kolmogorov-Loveland randomness and stochasticity
- Computable randomness and betting for computable probability spaces
- Kolmogorov complexity and the Recursion Theorem
- Algorithmic Randomness and Complexity
- Hyperimmune-free degrees and Schnorr triviality
- General random sequences and learnable sequences
- Measures and their random reals
- Computability and Randomness
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Randomness, relativization and Turing degrees
This page was built for publication: Strong reductions in effective randomness
