Treffer: On the relationship between deterministic time and deterministic reversal
Title:
On the relationship between deterministic time and deterministic reversal
Authors:
Source:
Information processing letters. 45(3):143-146
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 8 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Complexité calcul, Computing complexity, Complejidad cálculo, Complexité temps, Time complexity, Complejidad tiempo, Informatique théorique, Computer theory, Informática teórica, Machine Turing, Turing machine, Máquina Turing, Machine abstraite, Abstract machine, Máquina abstracta, Simulation, Simulación
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
TH Darmstadt, Inst. theoretische informatik, 6100 Darmstadt, Germany
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4753785
Database:
PASCAL Archive
Weitere Informationen
We investigate the relationship between the time and the reversal complexity measure for deterministic Turing machines. It is shown that for any function T, DTIME(T) ⊆ DREVERSAL(√T).