The following pages link to Jason Teutsch (Q342725):
Displaying 20 items.
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- How to build a probability-free casino (Q418145) (← links)
- Short lists for shortest descriptions in short time (Q475336) (← links)
- How powerful are integer-valued martingales? (Q693070) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Immunity and hyperimmunity for sets of minimal indices (Q929628) (← links)
- A savings paradox for integer-valued gambling strategies (Q2248910) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- On the Turing degrees of minimal index sets (Q2382278) (← links)
- Enumerations including laconic enumerators (Q2410366) (← links)
- On Approximate Decidability of Minimal Programs (Q2828213) (← links)
- Constant compression and random weights (Q2904759) (← links)
- Arithmetic complexity via effective names for random sequences (Q2946673) (← links)
- Closed left-r.e. sets (Q2964277) (← links)
- Closed Left-R.E. Sets (Q3010403) (← links)
- Index Sets and Universal Numberings (Q3576059) (← links)
- Constant Compression and Random Weights (Q4904464) (← links)
- Selection by Recursively Enumerable Sets (Q4922122) (← links)
- An incomplete set of shortest descriptions (Q5388731) (← links)
- Translating the Cantor set by a random real (Q5420104) (← links)
