There is No Composition in the Computable Reducibility Degrees
Logic
2024-05-27 v1
Abstract
We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice.
Cite
@article{arxiv.2405.15281,
title = {There is No Composition in the Computable Reducibility Degrees},
author = {Daniel Mourad},
journal= {arXiv preprint arXiv:2405.15281},
year = {2024}
}
Comments
6 pages