Deterministic Turing machines in the range between real-time and linear-time.
type: Item
instance of: scholarly article
title: Deterministic Turing machines in the range between real-time and linear-time.
zbMATH Open document ID: 1061.68053
DOI: 10.1016/S0304-3975(01)00272-9
author: Martin Kutrib
author: Andreas Klein
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1857064
zbMATH Keywords: Turing machines
zbMATH Keywords: Automata
zbMATH Keywords: Computational complexity
zbMATH Keywords: Time hierarchies
zbMATH Keywords: Fast computations
zbMATH Keywords: Closure properties
zbMATH Keywords: Speed-up
MaRDI profile type: Publication
cites work: Q4039803
cites work: Quasi-realtime languages
cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
cites work: Computational Complexity of One-Tape Turing Machine Computations
cites work: On the Computational Complexity of Algorithms
cites work: One-tape, off-line Turing machine computations
cites work: On proving time constructibility of functions
cites work: Q4160409
cites work: On time hierarchies
cites work: Real-Time Definable Languages
cites work: Q5599173
cites work: Q3707407
description: scientific article; zbMATH DE number 1857064