Extractors and an efficient variant of Muchnik's theorem

Daniil Musatov

(2008)

Issue: February, Publisher: K.U.Leuven - PhD., Pages: 37
  • arXiv ID: 0811.3958

Abstract

Muchnik's theorem about simple conditional descriprion states that for all words a and b there exists a short program p transforming a to b that has the least possible length and is simple conditional on b. This paper presents a new proof of this theorem, based on extractors. Employing the extractor technique, two new versions of Muchnik's theorem for space- and time-bounded Kolmogorov complexity are proven.

Organize, share and discover more research papers in
Computer and Information Science - Other.

Mendeley Desktop
Like iTunes™ for research papers.
Mendeley is a free research management tool for desktop & web.

Get Mendeley

While you can use Mendeley as standalone software, a free Mendeley account enables its powerful web-based features:

  • Improved PDF data extraction by cross-checking with external databases (e.g. CrossRef and PubMed)
  • Document sharing and collaboration
  • Document synchronization across multiple computers
  • Online document management in your browser
  • One-click document import from over 40 web databases
  • Access to research trend statistics
  • Networking with other researchers in your field

Read more about these features on the How It Works page. If you really don't want a Mendeley Web account, you can still download here.

Readership Statistics

2 Readers on Mendeley

by Discipline
100% Computer and Information Science

by Academic Status
50% Student (Bachelor)
50% Professor

by Country
50% Belgium
50% United States

Related Research