Where Join Preservation Fails in the Bounded Turing Degrees of C.E. Sets

DOI10.1007/978-3-319-17142-5_5zbMath1391.03029OpenAlexW2097835326MaRDI QIDQ2948451

Nadine Losert

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_5

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (2)

Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

This page was built for publication: Where Join Preservation Fails in the Bounded Turing Degrees of C.E. Sets