Dimensionality and randomness
From MaRDI portal
Cites work
- A computable analysis of majorizing martingales
- Algebra of invariant properties of binary sequences
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Bridging computational notions of depth
- Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
- Complex tilings
- Deep _1⁰ classes
- Denjoy, Demuth and density
- Depth, highness and DNR degrees
- Difference randomness
- Forbidden information
- Growth and irreducibility in path-incompressible trees
- Highness properties close to PA completeness
- scientific article; zbMATH DE number 4093436 (Why is no real title available?)
- scientific article; zbMATH DE number 3637728 (Why is no real title available?)
- scientific article; zbMATH DE number 5064956 (Why is no real title available?)
- Indifferent Sets
- Kolmogorov complexity and the recursion theorem
- Oscillation in the initial segment complexity of random reals
- Pathwise-randomness and models of second-order arithmetic
- Randomness conservation inequalities; information and independence in mathematical theories
- The definition of random sequences
- The importance of \(\Pi^0_1\) classes in effective randomness
- Theory of Random Sets
- Turing computability. Theory and applications
- Two notes on subshifts
- ∏ 0 1 Classes and Degrees of Theories
This page was built for publication: Dimensionality and randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325537)
