The following pages link to (Q3758821):
Displaying 15 items.
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- Characterizing strong randomness via Martin-Löf randomness (Q409318) (← links)
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- Characterizing the strongly jump-traceable sets via randomness (Q456804) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Demuth randomness and computational complexity (Q639659) (← links)
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem (Q714719) (← links)
- Randomness and lowness notions via open covers (Q764270) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Randomness and the linear degrees of computability (Q866567) (← links)
- Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
- Effectively closed sets of measures and randomness (Q958494) (← links)
- Optimal redundancy in computations from random oracles (Q1678164) (← links)
- Strong reductions in effective randomness (Q1758164) (← links)
