Abstract

In this talk we consider some issues related to the Infinite Time Turing Machine (ITTM) model of Hamkins & Lewis [3]. 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 [2] on “non-determinism” both in terms of non-deterministically halting ordinals (Theorem 2) and pointclasses defined by using such non-deterministic machines (Proposition 6).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call