On Languages Reducible to Algorithmically Random Languages
From MaRDI portal
Recommendations
Cited in
(16)- An improved zero-one law for algorithmically random sequences
- Computational depth and reducibility
- On collapsing the polynomial-time hierarchy
- Optimal redundancy in computations from random oracles
- Necessary conditions for subclasses of random context languages
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Randomness of formal languages via automatic martingales
- Limits on the Computational Power of Random Strings
- Separations by random oracles and ``almost classes for generalized reducibilities
- scientific article; zbMATH DE number 1759420 (Why is no real title available?)
- Computational depth and reducibility
- On the robustness of ALMOST-$\mathcal {R}$
- On complexity classes and algorithmically random languages (extended abstract)
- scientific article; zbMATH DE number 4187790 (Why is no real title available?)
- Local languages and the Berry-Sethi algorithm
- A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law
This page was built for publication: On Languages Reducible to Algorithmically Random Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327424)