Non-deterministic halting times for Hamkins-Kidder turing machines

PD Welch

doi:10.1007/11780342

Non-deterministic halting times for Hamkins-Kidder turing machines

Research output: Contribution to journal › Article (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 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	https://doi.org/10.1007/11780342
Publication status	Published - Jun 2006

Bibliographical note

Publisher: Springer-Verlag Berlin
Other identifier: IDS number BET34

Access to Document

10.1007/11780342

http://www.springerlink.com/content/n2320179387h1600/fulltext.pdf

Handle.net

Persistent link

Cite this

@article{6eccae6a9a5b4c748410909d3ba90d29,

title = "Non-deterministic halting times for Hamkins-Kidder turing machines",

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 {\^a}€{\oe}non-determinism{\^a}€� both in terms of non-deterministically halting ordinals (Theorem 2) and pointclasses defined by using such non-deterministic machines (Proposition 6).",

author = "PD Welch",

note = "Publisher: Springer-Verlag Berlin Other identifier: IDS number BET34",

year = "2006",

month = jun,

doi = "10.1007/11780342",

language = "English",

volume = "3988",

pages = "571 -- 574",

journal = "Lecture Notes in Computer Science ",

issn = "0302-9743",

publisher = "Springer Berlin Heidelberg",

}

TY - JOUR

T1 - Non-deterministic halting times for Hamkins-Kidder turing machines

AU - Welch, PD

N1 - Publisher: Springer-Verlag Berlin Other identifier: IDS number BET34

PY - 2006/6

Y1 - 2006/6

N2 - 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).

AB - 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).

U2 - 10.1007/11780342

DO - 10.1007/11780342

M3 - Article (Academic Journal)

SN - 0302-9743

VL - 3988

SP - 571

EP - 574

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

Non-deterministic halting times for Hamkins-Kidder turing machines

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this