Π11‐Martin‐Löf randomness and Π11‐Solovay completeness |
| |
Authors: | Claude Sureson |
| |
Abstract: | Developing an analogue of Solovay reducibility in the higher recursion setting, we show that results from the classical computably enumerable case can be extended to the new context. |
| |
Keywords: | |
|
|