◍wovepaper
SearchResearchersInstitutions
Sign in
math.LOMay 23, 2013
4
citations (OpenAlex)
authors
  • Laurent Bienvenu
  • Adam R. Day
  • Noam Greenberg
  • Antonín Kučera
  • Joseph S. Miller
  • André Nies
  • Dan Turetsky
institutions
  • Centre National de la Recherche Scientifique
  • Charles University
  • Laboratoire d'Informatique Algorithmique: Fondements et Applications
  • University of Auckland
  • University of California, Berkeley
  • University of Vienna
  • University of Wisconsin–Madison
  • Victoria University of Wellington
arXiv abstractPDF
paper

Computing K-Trivial Sets by Incomplete Random Sets

arXiv:1305.5514

Abstract

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 0'.

References in corpus (1)

  • Kolmogorov Complexity and Solovay Functions

Cited by in corpus (1)

  • Demuth's path to randomness
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.