G\'acs-Ku\v{c}era's Theorem Revisited by Levin

TL;DR

This paper revisits Gács-Kuera's theorem through Levin's concise proof, exploring its connections to image randomness theorems and the implications for oracle use in sequence reduction and algorithmic dimension theory.

Contribution

It provides a detailed explanation of Levin's proof, clarifies its relation to image randomness, and reviews prior work on oracle use and algorithmic dimension theory.

Findings

Levin's proof offers a simplified understanding of Gács-Kuera's theorem.

Connections between the proof and image randomness theorems are established.

The review of oracle use highlights its role in sequence reduction and algorithmic dimension.

Abstract

Leonid Levin (arxiv.org/abs/cs/0503039v14, p.7) published a new (and very nice) proof of G\'acs-Ku\v{c}era's theorem that occupies only a few lines when presented in his style. We try to explain more details and discuss the connection of this proof with image randomness theorems, making explicit some result (see Proposition 4) that is implicit in Levin's exposition. Then we review the previous work about the oracle use when reducing a given sequence to another one, and its connection with algorithmic dimension theory.