Gacs-Kucera theorem

DOI10.1016/J.TCS.2022.06.040OpenAlexW4283793785WikidataQ113863141 ScholiaQ113863141MaRDI QIDQ2166747

Leonid A. Levin

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.12489

zbMATH Keywords

complexityreducibilityrandomness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
• Every sequence is reducible to a random one
• Compression of Data Streams Down to Their Information Content
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Unnamed Item
• Unnamed Item

This page was built for publication: Gacs-Kucera theorem