Alexander G. Melnikov. Eliminating Unbounded Search in Computable Algebra. In Jarkko Kari, Florin Manea, Ion Petre, editors, Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Volume 10307 of Lecture Notes in Computer Science, pages 77-87, Springer, 2017. [doi]
Abstract is missing.