Pages that link to "Item:Q2267751"
From MaRDI portal
The following pages link to The basic theory of infinite time register machines (Q2267751):
Displaying 12 items.
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Characterizations of ITBM-computability. I (Q2026737) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Lower bounds on \(\beta (\alpha)\) (Q2104252) (← links)
- Clockability for ordinal Turing machines (Q2106588) (← links)
- The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
- The distribution of ITRM-recognizable reals (Q2453067) (← links)
- OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES (Q2795911) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 (Q3091451) (← links)
- $$ITRM$$-Recognizability from Random Oracles (Q3195690) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
