The following pages link to Adam R. Day (Q418115):
Displayed 27 items.
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- (Q519887) (redirect page) (← links)
- Notes on computable analysis (Q519888) (← links)
- The computable Lipschitz degrees of computably enumerable sets are not dense (Q636391) (← links)
- Process and truth-table characterisations of randomness (Q714787) (← links)
- (Q1358856) (redirect page) (← links)
- An algorithm for computing the effective linear elastic properties of heterogeneous materials: three-dimensional results for composites with equal phase Poisson ratios (Q1358857) (← links)
- On the computational power of random strings (Q2271990) (← links)
- Density, forcing, and the covering problem (Q2355765) (← links)
- Independence, relative randomness, and PA degrees (Q2443114) (← links)
- Randomness for non-computable measures (Q2846975) (← links)
- The typical Turing degree (Q2874662) (← links)
- COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS (Q2925324) (← links)
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS (Q2976336) (← links)
- Increasing the gap between descriptional complexity and algorithmic probability (Q3093481) (← links)
- Cupping with random sets (Q3189590) (← links)
- Ergodic-Type Characterizations of Algorithmic Randomness (Q3576190) (← links)
- JUMP OPERATIONS FOR BOREL GRAPHS (Q4638971) (← links)
- Indifferent sets for genericity (Q4916547) (← links)
- Three topological reducibilities for discontinuous functions (Q5046178) (← links)
- From Bi-Immunity to Absolute Undecidability (Q5407050) (← links)
- (Q5414578) (← links)
- Limits to joining with generics and randoms (Q5737985) (← links)
- Algorithmic Randomness For Amenable Groups (Q6297594) (← links)
- On a question of Slaman and Steel (Q6337824) (← links)
- Iterated Priority Arguments in Descriptive Set Theory (Q6417299) (← links)
- An Effective Classification of Borel Wadge Classes (Q6417300) (← links)