On the Topological Size of Sets of Random Strings

DOI10.1002/MALQ.19860320602MaRDI QIDQ3695274zbMATH OpenOpenAlexFDO

Authors Marius Zimand

Publication date 1986

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19860320602

zbMATH Keywords

Kolmogorov complexityrecursively rare setrelativized topology

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Note on the topological structure of random strings
• Logical Approaches to Computational Barriers
• On the complexity of random strings
• scientific article; zbMATH DE number 4128138
• An excursion to the Kolmogorov random strings

Cited in

(6)

• Algebraic sum of the image sets for a random string process
• Note on the topological structure of random strings
• On well-connected sets of strings
• The frequent paucity of trivial strings
• Random finite topologies and their thresholds
• On the Polynomial Depth of Various Sets of Random Strings

This page was built for publication: On the Topological Size of Sets of Random Strings

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