License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.34
URN: urn:nbn:de:0030-drops-80837
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8083/
Go to the corresponding LIPIcs Volume Portal


Anglès d'Auriac, Paul-Elliot ; Monin, Benoit

Another Characterization of the Higher K-Trivials

pdf-format:
LIPIcs-MFCS-2017-34.pdf (0.5 MB)


Abstract

In algorithmic randomness, the class of K-trivial sets has proved itself to be remarkable, due to its numerous different characterizations. We pursue in this paper some work already initiated on K-trivials in the context of higher randomness. In particular we give here another characterization of the non hyperarithmetic higher K-trivial sets.

BibTeX - Entry

@InProceedings{anglsdauriac_et_al:LIPIcs:2017:8083,
  author =	{Paul-Elliot Angl{\`e}s d'Auriac and Benoit Monin},
  title =	{{Another Characterization of the Higher K-Trivials}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{34:1--34:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8083},
  URN =		{urn:nbn:de:0030-drops-80837},
  doi =		{10.4230/LIPIcs.MFCS.2017.34},
  annote =	{Keywords: Algorithmic randomness, higher computability, K-triviality, effective descriptive set theory, Kolmogorov complexity}
}

Keywords: Algorithmic randomness, higher computability, K-triviality, effective descriptive set theory, Kolmogorov complexity
Seminar: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Issue Date: 2017
Date of publication: 22.11.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI