Multiple genericity: a new transfinite hierarchy of genericity notions

DOI10.1007/s11856-022-2331-5OpenAlexW4290975463MaRDI QIDQ2089803

Keng Meng Ng, Michael McInerney

Publication date: 24 October 2022

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-022-2331-5

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computer science (68-XX) Computability and recursion theory (03Dxx)

Related Items

Separating weak \(\alpha\)-change and \(\alpha\)-change genericity

Cites Work

• Minimal degrees recursive in 1-generic degrees
• Dynamic notions of genericity and array noncomputability
• Defining the Turing jump
• Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
• Lowness properties and randomness
• On Genericity and Ershov's Hierarchy
• The typical Turing degree
• Bounded Randomness
• Algorithmic Randomness and Complexity
• Notions of weak genericity
• A 1-generic degree which bounds a minimal degree
• The degrees below a 1-generic degree < 0′
• Double jumps of minimal degrees
• The Information Content of Typical Reals
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• A Hierarchy of Turing Degrees
• Computability and Randomness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item