The following pages link to (Q4934359):
Displaying 6 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. (Q1607291) (← links)
- Entropic measures, Markov information sources and complexity (Q1855845) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- Feasible analysis, randomness, and base invariance (Q2354578) (← links)
- Computing a Glimpse of Randomness (Q5472034) (← links)
