The following pages link to Register computations on ordinals (Q944224):
Displayed 9 items.
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Lower bounds on \(\beta (\alpha)\) (Q2104252) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- Minimality considerations for ordinal computers modeling constructibility (Q2482462) (← links)
- A Computational Approach to an Alternative Working Environment for the Constructible Universe (Q3091437) (← links)
- Ordinal Computability (Q3576060) (← links)
- On λ-Definable Functions on Ordinals (Q5326365) (← links)