Jun 27, 2018 · These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed ...

Sep 20, 2019 · These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed ...

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers.

Oct 5, 2018 · These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed ...

It is proved that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility ...

Computable reducibility is a well-established notion that allows to comparethe complexity of various equivalence relations over the natural numbers.

Measuring the complexity of reductions between equivalence relations. -. Citation: Fokina, E., Rossegger, D., & San Mauro, L. (2019). Measuring the complexity ...

Title: Measuring the Complexity of Reductions between Equivalence Relations ; Authors: San Mauro, Luca Francesco ; Category: Conference presentation ; Issue Date:.

The complexity is most often measured in Turing degrees. The degree of ... Measuring the complexity of reductions between equivalence relations. arXiv ...

from E to F is a function φ: X → Y sending E-equivalent points to F-equivalent points, a reduction of E to F is a homomor- phism sending E-inequivalent points ...