Turing machines with access to history

Bogdan S. Chlebus

doi:10.1016/0890-5401(90)90008-6

Turing machines with access to history

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	133-143
Number of pages	11
Journal	Information and Computation
Volume	89
Issue number	2
DOIs	https://doi.org/10.1016/0890-5401(90)90008-6
State	Published - Dec 1990
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1016/0890-5401(90)90008-6

Cite this

@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 = dec,

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

SN - 0890-5401

VL - 89

SP - 133

EP - 143

JO - Information and Computation

JF - Information and Computation

IS - 2

ER -

Turing machines with access to history

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this