Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
In this talk we consider some issues related to the Infinite Time Turing Machine (ITTM) model of Hamkins & Lewis . In particular our main results (Propositions 1 & 2) relate to Bounding times of the lengths of certain computations, and their application to certain questions raised in  on “non-determinism” both in terms of non-deterministically halting ordinals (Theorem 2) and pointclasses defined by using such non-deterministic machines (Proposition 6).
Unable to display preview. Download preview PDF.