There is No Composition in the Computable Reducibility Degrees
arXiv:2405.15281 · doi:10.1177/22113568251314744
Abstract
We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice.
6 pages