Pages that link to "Item:Q1032634"
From MaRDI portal
The following pages link to Ordinal machines and admissible recursion theory (Q1032634):
Displaying 12 items.
- Transfinite recursion and computation in the iterative conception of set (Q510712) (← links)
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- Towards computable analysis on the generalised real line (Q2011660) (← links)
- Characterizations of ITBM-computability. I (Q2026737) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073) (← links)
- Realisability for infinitary intuitionistic set theory (Q2700803) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- COMPUTABILITY IN UNCOUNTABLE BINARY TREES (Q5195058) (← links)
