On a theorem of gács

DOI10.1080/00207169308804199MaRDI QIDQ4285648zbMATH OpenOpenAlexFDO

Authors Ion 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

deterministic algorithmrandom sequencesprocessinfinite sequenceturing reducibility

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3890727
• scientific article; zbMATH DE number 3974332
• scientific article; zbMATH DE number 4043283
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 4071998

Cites work

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

Cited in

(2)

• A topological characterization of random sequences
• On a Theorem of Ganter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285648)