Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence

DOI10.1007/978-3-642-13962-8_43zbMath1286.03135OpenAlexW2229503964MaRDI QIDQ3576227

Dieter Spreen

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_43

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (1)

Computation over algebraic structures and a classification of undecidable problems

This page was built for publication: Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence