Randomness and reducibility
From MaRDI portal
Publication:1878680
Recommendations
Cites work
- scientific article; zbMATH DE number 1670880 (Why is no real title available?)
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 44959 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 3489017 (Why is no real title available?)
- scientific article; zbMATH DE number 3492569 (Why is no real title available?)
- scientific article; zbMATH DE number 3541937 (Why is no real title available?)
- scientific article; zbMATH DE number 3570424 (Why is no real title available?)
- scientific article; zbMATH DE number 736618 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 1136091 (Why is no real title available?)
- scientific article; zbMATH DE number 1531917 (Why is no real title available?)
- scientific article; zbMATH DE number 1543065 (Why is no real title available?)
- scientific article; zbMATH DE number 1405572 (Why is no real title available?)
- scientific article; zbMATH DE number 1408348 (Why is no real title available?)
- scientific article; zbMATH DE number 3307567 (Why is no real title available?)
- scientific article; zbMATH DE number 3340909 (Why is no real title available?)
- scientific article; zbMATH DE number 3351541 (Why is no real title available?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- A Theory of Program Size Formally Identical to Information Theory
- A characterization of c. e. random reals
- A formal theory of inductive inference. Part I
- A formal theory of inductive inference. Part II
- Algorithmic Information Theory
- Algorithmic randomness and complexity.
- Cohesive sets and recursively enumerable Dedekind cuts
- Computability Theory and Differential Geometry
- Constructive dimension equals Kolmogorov complexity
- Incompleteness theorems for random reals
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Kolmogorov complexity
- On the continued fraction representation of computable real numbers
- On the definitions of some complexity classes of real numbers
- Presentations of computably enumerable reals.
- Process complexity and effective random tests
- Randomness and recursive enumerability
- Randomness, computability, and density
- Reals which compute little
- Recursion Theory and Dedekind Cuts
- Recursive Real Numbers
- Recursive real numbers
- Relatively recursive reals and real functions
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- The fractal nature of Riem/Diff. I.
- There is no SW-complete c.e. real
- Three approaches to the quantitative definition of information*
- Trivial Reals
- Von Mises' definition of random sequences reconsidered
- Weakly computable real numbers
Cited in
(42)- Strong reductions in effective randomness
- On the strongly bounded Turing degrees of the computably enumerable sets
- Relative randomness and real closed fields
- Randomness and recursive enumerability
- Universal computably enumerable sets and initial segment prefix-free complexity
- Reducing Randomness via Irrational Numbers
- A minimal pair of 𝐾-degrees
- 2004 Annual Meeting of the Association for Symbolic Logic
- Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
- Reducibilities relating to Schnorr randomness
- The ibT degrees of computably enumerable sets are not dense
- Genericity of weakly computable objects
- Algorithmic randomness and measures of complexity
- Computability Results Used in Differential Geometry
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- Computing and Combinatorics
- Structures of some strong reducibilities
- Some Questions in Computable Mathematics
- Factoring Solovay-random extensions, with application to the reduction property
- Computing and Combinatorics
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Mass Problems and Randomness
- Initial segment complexities of randomness notions
- Universal Recursively Enumerable Sets of Strings
- Bounded Turing reductions and data processing inequalities for sequences
- Oreals with \(\Delta_2^0\)-bounded complexity and compressive power
- Calibrating Randomness
- Randomness and Computability: Open Questions
- scientific article; zbMATH DE number 1834658 (Why is no real title available?)
- Randomness, computability, and density
- Randomness and the linear degrees of computability
- Coherence of reducibilities with randomness notions
- Oscillation in the initial segment complexity of random reals
- On initial segment complexity and degrees of randomness
- Universal recursively enumerable sets of strings
- Solovay reducibility and continuity
- The computable Lipschitz degrees of computably enumerable sets are not dense
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- Random Oracle Reducibility
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Compressibility and Kolmogorov complexity
- Degrees of randomized computability
This page was built for publication: Randomness and reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878680)
