The following pages link to Turing complexity of the ordinals (Q580332):
Displaying 8 items.
- Measuring complexities of classes of structures (Q499081) (← links)
- A coding of the countable linear orderings (Q803179) (← links)
- \(\Pi^ 1_ 1\)-complete families of elementary sequences (Q1103613) (← links)
- Ordinal complexity of recursive definitions (Q1193596) (← links)
- Turing Computations On Ordinals (Q3370613) (← links)
- Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983) (← links)
- Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)
- Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization (Q5740666) (← links)
