Recommendations
- Some fundamental issues concerning degrees of unsolvability
- Comparing the degrees of enumerability and the closed Medvedev degrees
- The upward closure of a perfect thin class
- scientific article; zbMATH DE number 1688364
- Mass problems and almost everywhere domination
- Randomness, computability, and density
- Degrees of randomized computability
- Randomness and reducibility
- MASS PROBLEMS AND HYPERARITHMETICITY
- Low upper bounds in the LR degrees
Cites work
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A classification of the ordinal recursive functions
- A splitting theorem for the Medvedev and Muchnik lattices
- Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
- Axiomatizable theories with few axiomatizable extensions
- Class groups of integral group rings
- Classical recursion theory. Vol. II
- Comparing DNR and WWKL
- Degrees of Unsolvability. (AM-55)
- Density of the Medvedev lattice of ^0_1 classes
- Embeddings into the Medvedev and Muchnik lattices of ^0_1 classes
- Located sets and reverse mathematics
- Lowness for the class of random sets
- Measure theory and weak König's lemma
- On relative randomness
- Recursively enumerable sets of positive integers and their decision problems
- The definition of random sequences
- Vitali's theorem and WWKL
Cited in
(52)- Immunity for closed sets
- The upward closure of a perfect thin class
- Π10 classes with complex elements
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Mass problems associated with effectively closed sets
- Computability of countable subshifts in one dimension
- MASS PROBLEMS AND HYPERARITHMETICITY
- Medvedev degrees of two-dimensional subshifts of finite type
- Effectively closed mass problems and intuitionism
- Effectively closed sets and enumerations
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Degrees of difficulty of generalized r.e. separating classes
- Relativized depth
- A survey of Mučnik and Medvedev degrees
- The strength of the Besicovitch-Davies theorem
- Classes of Polish spaces under effective Borel isomorphism
- Intermediate logics and factors of the Medvedev lattice
- Medvedev degrees of generalized r.e. separating classes
- Deep _1⁰ classes
- Mass problems and measure-theoretic regularity
- Diagonally non-computable functions and bi-immunity
- On effectively closed sets of effective strong measure zero
- On the structure of the Medvedev lattice
- Hilbert's tenth problem for term algebras with a substitution operator
- Defining long words succinctly in FO and MSO
- Complemented subsets and Boolean-valued, partial functions
- Algorithmically random series
- Randomness notions and reverse mathematics
- Mass problems and density
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Mass problems and initial segment complexity
- choice classes
- Highness properties close to PA completeness
- The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable
- Mass problems and almost everywhere domination
- Theory and Applications of Models of Computation
- A closed subset of Baire space not Medvedev equivalent to any closed set of Cantor space
- A DNC function that computes no effectively bi-immune set
- Cone avoidance and randomness preservation
- Binary subtrees with few labeled paths
- Conservatively approximable functions
- Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely
- Comparing the Medvedev and Turing degrees of \(\Pi^{0}_{1}\) classes
- Some fundamental issues concerning degrees of unsolvability
- On the degree spectrum of a ^0_1 class
- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
- Comparing the degrees of enumerability and the closed Medvedev degrees
- Approximating Kolmogorov complexity
- Degrees of unsolvability: a tutorial
- Propagation of partial randomness
- Muchnik degrees and cardinal characteristics
This page was built for publication: Mass Problems and Randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370625)
