On the complexity of random strings
From MaRDI portal
Recommendations
Cited in
(25)- Deviations from uniformity in random strings
- Note on the topological structure of random strings
- An excursion to the Kolmogorov random strings
- Things that can be made into themselves
- The frequent paucity of trivial strings
- On the computational power of random strings
- On the Turing degrees of minimal index sets
- What can be efficiently reduced to the Kolmogorov-random strings?
- Randomness, computation and mathematics
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
- Random strings and truth-table degrees of Turing complete c.e. sets
- The Complexity of Complexity
- On the Polynomial Depth of Various Sets of Random Strings
- Limits on the Computational Power of Random Strings
- On a Conjecture about Binary Strings Distribution
- On the Topological Size of Sets of Random Strings
- Bounded Immunity and Btt-Reductions
- scientific article; zbMATH DE number 1747450 (Why is no real title available?)
- Power of Randomization in Automata on Infinite Strings
- Kolmogorov entropy in the context of computability theory
- On the complexity of learning strings and sequences
- On the computational power of C-random strings
- Constructivity conditions on immune sets
- Index sets and universal numberings
- A simple storage scheme for strings achieving entropy bounds
This page was built for publication: On the complexity of random strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593915)
