Saved in:
Bibliographic Details
Main Author: Mourad, Daniel
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2405.15281
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice.