The Information Content of Typical Reals

DOI10.1007/978-3-319-22156-4_8zbMath1403.03067OpenAlexW2276654757MaRDI QIDQ4637222

George Barmpalias, Andrew E. M. Lewis-Pye

Publication date: 18 April 2018

Published in: Turing’s Revolution (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22156-4_8

zbMATH Keywords

categorymeasuregenericityrandomnessTuring degrees

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (5)

Separating weak \(\alpha\)-change and \(\alpha\)-change genericity ⋮ Random numbers as probabilities of machine behavior ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions ⋮ Randomness below complete theories of arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic degrees are complemented
• Minimal degrees recursive in 1-generic degrees
• Category methods in recursion theory
• Classical recursion theory. The theory of functions and sets of natural numbers
• The upper semi-lattice of degrees of recursive unsolvability
• The typical Turing degree
• Properties of the jump classes
• THE TURING DEGREES BELOW GENERICS AND RANDOMS
• A note on the join property
• Algorithmic Randomness and Complexity
• Measure-theoretic construction of incomparable hyperdegrees
• Notions of weak genericity
• A 1-generic degree which bounds a minimal degree
• Indifferent Sets
• Relative recursive enumerability of generic degrees
• Banach–Mazur games, comeager sets and degrees of unsolvability
• Measure and minimal degrees
• A 1-generic degree with a strong minimal cover
• Indifferent sets for genericity
• Every n-generic degree is a minimal cover of an n-generic degree
• Computability and Randomness
• Degrees of Unsolvability. (AM-55)
• Randomness, relativization and Turing degrees

This page was built for publication: The Information Content of Typical Reals