Levin–Schnorr theorem

E1780405 UNEXPLORED

The Levin–Schnorr theorem is a fundamental result in algorithmic randomness that characterizes Martin-Löf random sequences in terms of their incompressibility as measured by Kolmogorov complexity.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Levin–Schnorr theorem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Martin-Löf randomness → relatedTo → Levin–Schnorr theorem ⓘ