Post's Problem for Ordinal Register Machines

We study Post’s Problem for the ordinal register machines defined in [6], 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 [3] for infinite-time Turing machines, and also provides insight into the different methods required for register machines and Turing machines in infinite time.

• Type: Conference
• Year: 2007
• Where: CIE
• Authors: Joel David Hamkins, Russell G. Miller
• Keywords: CIE 2007, Ordinal Register Machines, Register Machines, Turing Machines