Citation:
Fokina, Ekaterina , Dino Rossegger, and Luca San Mauro. “Measuring the Complexity of Reductions between Equivalence Relations”. Computability Preprint (2018): 1-16. https://arxiv.org/abs/1806.10363.
Abstract:
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibil
