K-Triviality of Closed Sets and Continuous Functions

DOI10.1093/logcom/exn021zbMath1158.03029OpenAlexW2038973889MaRDI QIDQ3611719

Douglas Cenzer, George Barmpalias, Rebecca Weber, Jeffery B. Remmel

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn021

zbMATH Keywords

computabilityrandomnessMedvedev degrees\({\Pi}_1^0\) classes

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Related Items

A Survey of Mučnik and Medvedev Degrees, Algorithmically Random Functions and Effective Capacities, Comparing the Medvedev and Turing degrees of Π⁰₁ classes, $K$-triviality in computable metric spaces