Computing k-trivial sets by incomplete random sets

Bulletin of Symbolic Logic 20 (1):80-90 (2014)
  Copy   BIBTEX

Abstract

EveryK-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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,509

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2016-06-30

Downloads
21 (#536,903)

6 months
1 (#417,896)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Randomness Notions and Reverse Mathematics.André Nies & Paul Shafer - 2020 - Journal of Symbolic Logic 85 (1):271-299.
Computing From Projections of Random Points.Noam Greenberg, Joseph S. Miller & André Nies - 2019 - Journal of Mathematical Logic 20 (1):1950014.
Lebesgue Density and Classes.Mushfeq Khan - 2016 - Journal of Symbolic Logic 81 (1):80-95.

Add more citations

References found in this work

Randomness and Computability: Open Questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
Benign Cost Functions and Lowness Properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
Low Upper Bounds of Ideals.Antonín Kučera & Theodore A. Slaman - 2009 - Journal of Symbolic Logic 74 (2):517-534.
On Relative Randomness.Antonín Kučera - 1993 - Annals of Pure and Applied Logic 63 (1):61-67.
Lowness for the Class of Random Sets.Antonín Kučera & Sebastiaan A. Terwijn - 1999 - Journal of Symbolic Logic 64 (4):1396-1402.

Add more references