Turing machines with access to history

Bogdan S. Chlebus

Research output: Contribution to journalArticle

Abstract

We study remembering Turing machines, that is Turing machines with the capability to access freely the history of their computations. These devices can detect in one step via the oracle mechanism whether the storage tapes have exactly the same contents at the moment of inquiry as at some past moment in the computation. The s(n)-space-bounded remembering Turing machines are shown to be able to recognize exactly the languages in the time-complexity class determined by bounds exponential in s(n). This is proved for deterministic, non-deterministic, and alternating Turing machines.

Original languageEnglish (US)
Pages (from-to)133-143
Number of pages11
JournalInformation and Computation
Volume89
Issue number2
DOIs
StatePublished - Dec 1990
Externally publishedYes

Fingerprint

Turing machines
Turing Machine
Moment
Exponential Bound
Complexity Classes
Time Complexity
History

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Turing machines with access to history. / Chlebus, Bogdan S.

In: Information and Computation, Vol. 89, No. 2, 12.1990, p. 133-143.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. / Turing machines with access to history. In: Information and Computation. 1990 ; Vol. 89, No. 2. pp. 133-143.
@article{6f14bd3ee3944d1c8be0d5aa5071c5a6,
title = "Turing machines with access to history",
abstract = "We study remembering Turing machines, that is Turing machines with the capability to access freely the history of their computations. These devices can detect in one step via the oracle mechanism whether the storage tapes have exactly the same contents at the moment of inquiry as at some past moment in the computation. The s(n)-space-bounded remembering Turing machines are shown to be able to recognize exactly the languages in the time-complexity class determined by bounds exponential in s(n). This is proved for deterministic, non-deterministic, and alternating Turing machines.",
author = "Chlebus, {Bogdan S.}",
year = "1990",
month = "12",
doi = "10.1016/0890-5401(90)90008-6",
language = "English (US)",
volume = "89",
pages = "133--143",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Turing machines with access to history

AU - Chlebus, Bogdan S.

PY - 1990/12

Y1 - 1990/12

N2 - We study remembering Turing machines, that is Turing machines with the capability to access freely the history of their computations. These devices can detect in one step via the oracle mechanism whether the storage tapes have exactly the same contents at the moment of inquiry as at some past moment in the computation. The s(n)-space-bounded remembering Turing machines are shown to be able to recognize exactly the languages in the time-complexity class determined by bounds exponential in s(n). This is proved for deterministic, non-deterministic, and alternating Turing machines.

AB - We study remembering Turing machines, that is Turing machines with the capability to access freely the history of their computations. These devices can detect in one step via the oracle mechanism whether the storage tapes have exactly the same contents at the moment of inquiry as at some past moment in the computation. The s(n)-space-bounded remembering Turing machines are shown to be able to recognize exactly the languages in the time-complexity class determined by bounds exponential in s(n). This is proved for deterministic, non-deterministic, and alternating Turing machines.

UR - http://www.scopus.com/inward/record.url?scp=0025669381&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025669381&partnerID=8YFLogxK

U2 - 10.1016/0890-5401(90)90008-6

DO - 10.1016/0890-5401(90)90008-6

M3 - Article

AN - SCOPUS:0025669381

VL - 89

SP - 133

EP - 143

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 2

ER -