The following pages link to Ordinal Computability (Q3576060):
Displaying 13 items.
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← 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 distribution of ITRM-recognizable reals (Q2453067) (← links)
- The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073) (← links)
- OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES (Q2795911) (← links)
- A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 (Q3091451) (← links)
- $$ITRM$$-Recognizability from Random Oracles (Q3195690) (← links)
- Finding bases of uncountable free abelian groups is usually difficult (Q4608785) (← links)
- (Q5109524) (← links)
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 (Q5305554) (← links)
