All Questions
1 question
1
vote
1
answer
362
views
How are Koepke's ordinal computability and E-recursion related?
In Koepke's paper, "Turing Computations On Ordinals", one has the following (well-known) result:
A set $x$ is ordinal computable from a finite set of ordinal parameters if and only if it is ...
- 3,065