Pages that link to "Item:Q5898813"
From MaRDI portal
The following pages link to Logical Approaches to Computational Barriers (Q5898813):
Displaying 11 items.
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- Kobayashi compressibility (Q528498) (← links)
- Not every domain of a plain decompressor contains the domain of a prefix-free one (Q620966) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Time-bounded incompressibility of compressible strings and sequences (Q989573) (← links)
- Pushdown dimension (Q995564) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Optimal redundancy in computations from random oracles (Q1678164) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees (Q5189151) (← links)