There is No Composition in the Computable Reducibility Degrees
Abstract
We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.