Pages that link to "Item:Q2011653"
From MaRDI portal
The following pages link to The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653):
Displaying 4 items.
- Ordinal machines and admissible recursion theory (Q1032634) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Optimal results on recognizability for infinite time register machines (Q2795911) (← links)
- Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)