Computability and randomness
From MaRDI portal
\(K\)-trivialityalgorithmic information theorydescriptive complexitylownessrandom sequencesrandom setsrandom strings
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Algorithmic randomness and dimension (03D32) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Recommendations
Cited in
(only showing first 100 items - show all)- On randomness, determinism and computability
- The computability, definability, and proof theory of Artinian rings
- On the uniform computational content of the Baire category theorem
- Lowness and logical depth
- Optimal redundancy in computations from random oracles
- Schnorr randomness for noncomputable measures
- A generalized characterization of algorithmic probability
- Martin-Löf random generalized Poisson processes
- On the computability of Solomonoff induction and AIXI
- Limit-depth and DNR degrees
- Descriptive indexicals and epistemic modality
- Two more characterizations of \(K\)-triviality
- A Chaitin number based on compressible strings
- Finite-state independence
- Coherence of reducibilities with randomness notions
- Algorithmically random series and Brownian motion
- Compressibility and Kolmogorov complexity
- Time-bounded Kolmogorov complexity and Solovay functions
- Effective randomness of unions and intersections
- Characterization of Kurtz randomness by a differentiation theorem
- On the gap between trivial and nontrivial initial segment prefix-free complexity
- Revisiting Chaitin's incompleteness theorem
- Algorithmic randomness and Fourier analysis
- Computable analogs of cardinal characteristics: prediction and rearrangement
- On low for speed oracles
- Prefix-free quantum Kolmogorov complexity
- Randomness and initial segment complexity for measures
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice
- Limitwise monotonic spectra and their generalizations
- The computational complexity of module socles
- Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts
- Bounded-low sets and the high/low hierarchy
- Absolutely no free lunches!
- On fairly low and superlow sets
- Granularity of wagers in games and the possibility of saving
- Subcomputable Hausdorff function dimension
- Bi-immunity over different size alphabets
- Things that can be made into themselves
- The frequent paucity of trivial strings
- Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness
- Searching for shortest and least programs
- Monotonous betting strategies in warped casinos
- Polylog depth, highness and lowness for E
- Reductions between types of numberings
- Martin-Löf randomness implies multiple recurrence in effectively closed sets
- Unified characterizations of lowness properties via Kolmogorov complexity
- Cone avoidance and randomness preservation
- Unpredictability of complex (pure) strategies
- Random reals as measures of natural open sets
- Resource-bounded martingales and computable Dowd-type generic sets
- Probabilistic computability and choice
- A reducibility related to being hyperimmune-free
- Universality, optimality, and randomness deficiency
- Integer valued betting strategies and Turing degrees
- Feasible analysis, randomness, and base invariance
- Schnorr triviality and its equivalent notions
- Trivial measures are not so trivial
- Cryptography and algorithmic randomness
- Genericity of weakly computable objects
- Higher randomness and forcing with closed sets
- Differences of halting probabilities
- Polynomial clone reducibility
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Independence, relative randomness, and PA degrees
- Lowness for difference tests
- A bounded jump for the bounded Turing degrees
- The axiomatic power of Kolmogorov complexity
- On effectively closed sets of effective strong measure zero
- Strong jump-traceability. I: The computably enumerable case
- Finite state incompressible infinite sequences
- Effectivity questions for Kleene's recursion theorem
- Initial segment complexities of randomness notions
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Randomness and uniform distribution modulo one
- On continued fraction randomness and normality
- The Kučera-Gács theorem revisited by Levin
- Relativized depth
- Strong determinism vs. computability
- scientific article; zbMATH DE number 1688364 (Why is no real title available?)
- Demuth's path to randomness
- Randomness in the higher setting
- K-triviality in computable metric spaces
- Measure and cupping in the Turing degrees
- Randomness for non-computable measures
- Schnorr randomness and the Lebesgue differentiation theorem
- Diagonally non-computable functions and bi-immunity
- When does randomness come from randomness?
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
- A survey of Mučnik and Medvedev degrees
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- A level of Martin-Lof randomness.
- Randomness, computation and mathematics
- Characterizing lowness for Demuth randomness
- JSL volume 79 issue 2 Cover and Front matter
- Sub-computable Boundedness Randomness
- On zeros of Martin-Löf random Brownian motion
- K-trivial, K-low and MLR-low sequences: a tutorial
- Depth, highness and DNR degrees
- On the strongly bounded Turing degrees of the computably enumerable sets
- Lowness, Randomness, and Computable Analysis
This page was built for publication: Computability and randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611832)
