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.

中文翻译：

---

Π11-Martin-Löf随机性和Π11-Solovay完整性

在更高的递归设置中开发Solovy可简化性的类似物，我们证明了经典可计算枚举案例的结果可以扩展到新的背景。