Gacs-Kucera Theorem
Computational Complexity
2022-08-23 v1
Abstract
Gacs-Kucera Theorem, tightened by Barmpalias and Lewis-Pye, w.t.t.-reduces each infinite sequence to a Kolmogorov--Martin-Lof random one and is broadly used in various Math and CS areas. Its early proofs are somewhat cumbersome, but using some general concepts yields significant simplification illustrated here.
Cite
@article{arxiv.2207.12489,
title = {Gacs-Kucera Theorem},
author = {Leonid A. Levin},
journal= {arXiv preprint arXiv:2207.12489},
year = {2022}
}
Comments
1 page. Theoretical Computer Science, 2022