Raised the question of the existence of an uncomputable recursively enumerable set whose Turing degree is less than that of the halting problem
Text from Wikipedia, available under CC BY-SA 4.0.
- #wikipedia
- #event
Raised the question of the existence of an uncomputable recursively enumerable set whose Turing degree is less than that of the halting problem
Text from Wikipedia, available under CC BY-SA 4.0.
Captured 2026-08-24 from Wikipedia. The archived copy is preserved so this citation survives link rot.