Non-deterministic halting times for Hamkins-Kidder turing machines

Research output: Contribution to journalArticle (Academic Journal)peer-review

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 contributionNon-deterministic halting times for Hamkins-Kidder turing machines
Original languageEnglish
Pages (from-to)571 - 574
Number of pages4
JournalLecture Notes in Computer Science
Volume3988
DOIs
Publication statusPublished - Jun 2006

Bibliographical note

Publisher: Springer-Verlag Berlin
Other 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