Pages that link to "Item:Q1738872"
From MaRDI portal
The following pages link to Ordinal computability. An introduction to infinitary machines (Q1738872):
Displaying 9 items.
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Lower bounds on \(\beta (\alpha)\) (Q2104252) (← links)
- The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- Weaker variants of infinite time Turing machines (Q2309496) (← links)
- Realisability for infinitary intuitionistic set theory (Q2700803) (← links)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609) (← links)
- Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)
- Space-bounded OTMs and REG ∞ (Q5037216) (← links)
