Depth, highness and DNR degrees
From MaRDI portal
Publication:2947871
Recommendations
Cites work
- scientific article; zbMATH DE number 193560 (Why is no real title available?)
- scientific article; zbMATH DE number 1048037 (Why is no real title available?)
- A Theory of Program Size Formally Identical to Information Theory
- A minimal pair of 𝐾-degrees
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Classical recursion theory. The theory of functions and sets of natural numbers
- Computability and randomness
- Computational depth and reducibility
- Computational depth: Concept and applications
- Depth as randomness deficiency
- Every 2-random real is Kolmogorov random
- Feasible Depth
- Finite self-information
- On the gap between trivial and nontrivial initial segment prefix-free complexity
- On the polynomial depth of various sets of random strings
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Randomness, relativization and Turing degrees
- Recursive computational depth.
- Schnorr trivial sets and truth-table reducibility
- The importance of \(\Pi^0_1\) classes in effective randomness
- ∏ 0 1 Classes and Degrees of Theories
Cited in
(6)
This page was built for publication: Depth, highness and DNR degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947871)