Post’s Problem for Ordinal Register Machines
We study Post’s Problem for the ordinal register machines defined in , showing that its general solution is positive, but that any set of ordinals solving it must be unbounded in the writable ordinals. This mirrors the results in  for infinite-time Turing machines, and also provides insight into the different methods required for register machines and Turing machines in infinite time.
Keywordscomputability ordinal computability ordinal register machine Post’s Problem
Unable to display preview. Download preview PDF.