EUVIMEDEUVIMED entdecken
Crossref

There is no composition in the [strong] computable reducibility degrees

Daniel S Mourad

Computability · 2025

DOI: 10.1177/22113568251314744 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computability, 2025. Verfasst von Daniel S Mourad. Die Arbeit nennt 7 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Mourad, D. S. (2025). There is no composition in the [strong] computable reducibility degrees. Computability. https://doi.org/10.1177/22113568251314744

Vancouver

Mourad DS. There is no composition in the [strong] computable reducibility degrees. Computability. 2025. doi:10.1177/22113568251314744

BibTeX
@article{Mourad2025,
  author = {Mourad, Daniel S},
  title = {There is no composition in the [strong] computable reducibility degrees},
  journal = {Computability},
  year = {2025},
  doi = {10.1177/22113568251314744}
}
Kostenlos starten →