EUVIMEDEUVIMED entdecken
Crossref

COMPUTING K -TRIVIAL SETS BY INCOMPLETE RANDOM SETS

LAURENT BIENVENU, ADAM R. DAY, NOAM GREENBERG, ANTONÍN KUČERA, JOSEPH S. MILLER, ANDRÉ NIES, DAN TURETSKY

The Bulletin of Symbolic Logic · 2014

DOI: 10.1017/bsl.2013.3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Bulletin of Symbolic Logic, 2014. Verfasst von LAURENT BIENVENU und 6 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 35 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Every K -trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute the halting problem.

Zitieren

APA

BIENVENU, L., DAY, A. R., GREENBERG, N., KUČERA, A., MILLER, J. S., NIES, A., & TURETSKY, D. (2014). COMPUTING K -TRIVIAL SETS BY INCOMPLETE RANDOM SETS. The Bulletin of Symbolic Logic. https://doi.org/10.1017/bsl.2013.3

Vancouver

BIENVENU L, DAY AR, GREENBERG N, KUČERA A, MILLER JS, NIES A, et al. COMPUTING K -TRIVIAL SETS BY INCOMPLETE RANDOM SETS. The Bulletin of Symbolic Logic. 2014. doi:10.1017/bsl.2013.3

BibTeX
@article{BIENVENU2014,
  author = {BIENVENU, LAURENT and DAY, ADAM R. and GREENBERG, NOAM and KUČERA, ANTONÍN and MILLER, JOSEPH S. and NIES, ANDRÉ and TURETSKY, DAN},
  title = {COMPUTING K -TRIVIAL SETS BY INCOMPLETE RANDOM SETS},
  journal = {The Bulletin of Symbolic Logic},
  year = {2014},
  doi = {10.1017/bsl.2013.3}
}
Kostenlos starten →