Randomness via effective descriptive set theory

DOI10.1112/jlms/jdm022zbMath1118.03034MaRDI QIDQ5294149

André Nies, Greg Hjorth

Publication date: 23 July 2007

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/jdm022

zbMATH Keywords

random set; effective descriptive set theory

Mathematics Subject Classification ID

03E15: Descriptive set theory

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

03D60: Computability and recursion theory on ordinals, admissible sets, etc.

Related Items

RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY, HIGHER RANDOMNESS AND GENERICITY, Unnamed Item, Π11‐Martin‐Löf randomness and Π11‐Solovay completeness, GENERICITY AND RANDOMNESS WITH ITTMS, Continuous higher randomness, Randomness and degree theory for infinite time register machines1, \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets, Higher Kurtz randomness, Lowness of higher randomness notions, Bad oracles in higher computability and randomness, Higher randomness and forcing with closed sets, RANDOMNESS IN THE HIGHER SETTING, Measure-theoretic applications of higher Demuth’s Theorem, A New Proof of Friedman's Conjecture, From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II