◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Laurent Bienvenu

0 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

ORCID 0000-0002-9638-3362

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.CC2009★ 16 cited

Kolmogorov Complexity and Solovay Functions

Laurent Bienvenu, Rod Downey

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we cons…

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