The following pages link to The typical Turing degree (Q2874662):
Displaying 11 items.
- Diagonally non-computable functions and fireworks (Q515575) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- Multiple genericity: a new transfinite hierarchy of genericity notions (Q2089803) (← links)
- Randomness below complete theories of arithmetic (Q2112795) (← links)
- Separating weak \(\alpha\)-change and \(\alpha\)-change genericity (Q2140582) (← links)
- ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY (Q4628689) (← links)
- The Information Content of Typical Reals (Q4637222) (← links)
- DEGREES OF RANDOMIZED COMPUTABILITY (Q5067871) (← links)
- A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE (Q5207555) (← links)
- Continuous randomness via transformations of 2-random sequences (Q6040663) (← links)
