Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility

DOI10.1007/978-3-319-40189-8_24zbMath1476.03054OpenAlexW2490415085MaRDI QIDQ3188261

Gemma Carotenuto, André Nies

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_24

Mathematics Subject Classification ID

Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Coherent randomness tests and computing the \(K\)-trivial sets
• Classical recursion theory. The theory of functions and sets of natural numbers
• The descriptive set theory of the Lebesgue density theorem
• Density, forcing, and the covering problem
• LEBESGUE DENSITY AND CLASSES
• COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
• Creativeness and completeness in recursion categories of partial recursive operators
• USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
• Computability and Randomness

This page was built for publication: Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility