On a theorem of gács

DOI10.1080/00207169308804199zbMath0789.68075OpenAlexW2312717242MaRDI QIDQ4285648

Ion I. Măndoiu

Publication date: 17 March 1994

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804199

zbMATH Keywords

random sequencesdeterministic algorithmprocessinfinite sequenceturing reducibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

A topological characterization of random sequences

Cites Work

• Every sequence is reducible to a random one
• The definition of random sequences

This page was built for publication: On a theorem of gács