Algorithmic randomness and complexity.
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Recommendations
Cited in
(only showing first 100 items - show all)- Immunity for closed sets
- Hierarchy of Computably Enumerable Degrees II
- Universal computably enumerable sets and initial segment prefix-free complexity
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- The upward closure of a perfect thin class
- On Resource-Bounded Versions of the van Lambalgen Theorem
- Computability of Real Numbers
- An incomplete set of shortest descriptions
- Quantum algorithmic randomness
- Turing patterns with Turing machines: emergence and low-level structure formation
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Probability and random number. A first guide to randomness
- Process and truth-table characterisations of randomness
- Randomness and initial segment complexity for measures
- Unpredictability and computational irreducibility
- Computing halting probabilities from other halting probabilities
- Unprincipled
- scientific article; zbMATH DE number 4113619 (Why is no real title available?)
- Pathwise-randomness and models of second-order arithmetic
- Mass problems associated with effectively closed sets
- On the logical strengths of partial solutions to mathematical problems
- Random reals as measures of natural open sets
- On the computational power of random strings
- Polynomial clone reducibility
- Lowness for bounded randomness
- Lower bounds for Levin-Kolmogorov complexity
- The definability strength of combinatorial principles
- On low for speed oracles
- A Pseudo-Random Generator Whose Output is a Normal Sequence
- Bohmian mechanics is not deterministic
- Finite state incompressible infinite sequences
- On the Unpredictability of Individual Quantum Measurement Outcomes
- Oscillation in the initial segment complexity of random reals
- Time-bounded Kolmogorov complexity and Solovay functions
- Algorithmically independent sequences
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice
- Strong Medvedev reducibilities and the KL-randomness problem
- On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
- Randomness and universal machines
- Jump inversions inside effectively closed sets and applications to randomness
- KL-randomness and effective dimension under strong reducibility
- Granularity of wagers in games and the possibility of saving
- Algorithmic randomness and Fourier analysis
- The smallest probability interval a sequence is random for: a study for six types of randomness
- scientific article; zbMATH DE number 7453171 (Why is no real title available?)
- Translating the Cantor set by a random real
- On infinite direct sums of minimal numberings of functional families
- Effectively closed sets of measures and randomness
- A savings paradox for integer-valued gambling strategies
- SOME CONSEQUENCES OF AND
- Exact pairs for the ideal of the \(K\)-trivial sequences in the Turing degrees
- Medvedev degrees of two-dimensional subshifts of finite type
- Capacitability for Co-Analytic Sets
- On Oscillation-Free Chaitin h-Random Sequences
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- Equivalences between learning of data and probability distributions, and their applications
- Asymptotic density, computable traceability, and 1-randomness
- Martin-Löf random quantum states
- Strong reductions between combinatorial principles
- A note on density estimation for binary sequences
- Lowness for difference tests
- Fixed point theorems on partial randomness
- Calculus of cost functions
- Randomness for non-computable measures
- Lawvere-Tierney topologies for computability theorists
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Integer valued betting strategies and Turing degrees
- Kolmogorov-Loveland stochasticity and Kolmogorov complexity
- The ibT degrees of computably enumerable sets are not dense
- Continuity theorems for a class of computable operators
- Some more results on relativized Chaitin's
- A Correspondence Principle for Exact Constructive Dimension
- Forcing with bushy trees
- Some Questions in Computable Mathematics
- The Complexity of Complexity
- A new quantum random number generator certified by value indefiniteness
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Recognizing strong random reals
- Liouville, computable, Borel normal and Martin-Löf random numbers
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
- \textit{CEA}-operators and the Ershov hierarchy. I
- A level of Martin-Lof randomness.
- \(K\)-trivial, \(K\)-low and MLR-low sequences: a tutorial
- Refining the taming of the reverse mathematics zoo
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Incomputability emergent, and higher type computation
- Effectively approximating measurable sets by open sets
- Finite state complexity
- Some observations on mitotic sets
- A Church-Turing thesis for randomness?
- Randomising realizability
- Imprecision in martingale- and test-theoretic prequential randomness
- Comparing notions of randomness
- Relativized depth
- Complexity and randomness
- Measure-theoretic applications of higher Demuth's theorem
- The birth and early years of parameterized complexity
- Limit computability and ultrafilters
This page was built for publication: Algorithmic randomness and complexity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161424)
