Want to do a literature review? Try our new Literature Review workflow
- https://doi.org/10.1177/22113568251314744
There is no composition in the [strong] computable reducibility degrees
Abstract
Translate Article 
Translate Article We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice. We show the same in the strong computable reducibility setting.
Save Important notes in documents
Highlight text to save as a note, or write notes directly
You can also access these Documents in Paperpal, our AI writing tool
Powered by our AI Writing Assistant
