Gacs-Kucera theorem (Q2166747)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Gacs-Kucera theorem	scientific article

Statements

scholarly article

0 references

Gacs-Kucera theorem (English)

0 references

Leonid A. Levin

0 references

Theoretical Computer Science

0 references

publication date

25 August 2022

0 references

full work available at URL

https://arxiv.org/abs/2207.12489

0 references

zbMATH Keywords

randomness

0 references

complexity

0 references

reducibility

0 references

MaRDI profile type

MaRDI publication profile

0 references

Compression of Data Streams Down to Their Information Content

0 references

Every sequence is reducible to a random one

0 references

0 references

Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)

0 references

0 references

THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

0 references

Identifiers

10.1016/j.tcs.2022.06.040

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2166747

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2166747&oldid=36845794"