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).
| Translated title of the contribution | Non-deterministic halting times for Hamkins-Kidder turing machines |
|---|---|
| Original language | English |
| Pages (from-to) | 571 - 574 |
| Number of pages | 4 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3988 |
| DOIs | |
| Publication status | Published - Jun 2006 |
Bibliographical note
Publisher: Springer-Verlag BerlinOther identifier: IDS number BET34
Fingerprint
Dive into the research topics of 'Non-deterministic halting times for Hamkins-Kidder turing machines'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver