The following pages link to New Computational Paradigms (Q5717051):
Displaying 6 items.
- Working below a \(low_ 2\) recursively enumerable degree (Q584251) (← links)
- Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy (Q646830) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- Non-uniformity and generalised Sacks splitting (Q1862888) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Splitting theorems and low degrees (Q5211064) (← links)