Higher Kurtz randomness

DOI10.1016/j.apal.2010.04.001zbMath1223.03025arXiv1408.2896OpenAlexW2003802282MaRDI QIDQ636362

Liang Yu, Frank Stephan, André Nies, Bjørn Kjos-Hanssen

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2896

zbMATH Keywords

lownesshyperarithmeticKurtz randomnesshyperdegrees

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (4)

HIGHER RANDOMNESS AND GENERICITY ⋮ RANDOMNESS IN THE HIGHER SETTING ⋮ AN APPLICATION OF RECURSION THEORY TO ANALYSIS ⋮ Measure-theoretic applications of higher Demuth’s Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lowness of higher randomness notions
• Descriptive set theory
• Countable admissible ordinals and hyperdegrees
• On Kurtz randomness
• Computational randomness and lowness
• Kolmogorov complexity and the Recursion Theorem
• Hyperarithmetical quantifiers
• Lowness for Kurtz randomness
• Measure and category in effective descriptive set theory
• Higher Recursion Theory
• Randomness via effective descriptive set theory
• Some applications of the notions of forcing and generic sets
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Incompleteness along paths in progressions of theories

This page was built for publication: Higher Kurtz randomness