Nonerasing, Counting, and Majority over the Linear Time Hierarchy

In this paper, we investigate several extensions of the linear time hierarchy (denoted by LTH). We first prove that it is not necessary to erase the oracle tape between two successive oracle calls, thereby lifting a common restriction on LTH machines. We also define a natural counting extension of L...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information and computation Jg. 174; H. 2; S. 132 - 142
Hauptverfasser:	Durand, Arnaud, More, Malika
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.05.2002 Elsevier
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science; control theory; systems Exact sciences and technology Theoretical computing counting classes rudimentary relations logic in computer science computational and structural complexity Hierarchy Turing machine Linear time Logic Oracle Computational complexity Counting
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!