This paper has two purposes. The first is to investigate the characteristics of a restricted class of Turing machines, and to develop a simple tool for describing their computations. The second is to present specific problems for which tight lower bounds can be found for the computation times required by Turing machines of this restricted class
We prove the following lower bounds for on-line computation. 1) Simulating two tape nondeterministic...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turin...
It is shown that for any ε > 0 and for any sufficiently large l (1 — ε)2l2/logbQ is a lower bound fo...
AbstractThis paper contains the first concrete lower bound argument for Turing machines with one wor...
In this paper we use arguments about the size of the computed functions to investigate the computati...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
We present two restricted versions of one-tape Turing machines. Both characterize the class of conte...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
AbstractA series of existing lower bound results for deterministic one-tape Turing machines is exten...
We prove the following lower bounds for on-line computation. 1) Simulating two tape nondeterministic...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turin...
It is shown that for any ε > 0 and for any sufficiently large l (1 — ε)2l2/logbQ is a lower bound fo...
AbstractThis paper contains the first concrete lower bound argument for Turing machines with one wor...
In this paper we use arguments about the size of the computed functions to investigate the computati...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
We present two restricted versions of one-tape Turing machines. Both characterize the class of conte...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
AbstractA series of existing lower bound results for deterministic one-tape Turing machines is exten...
We prove the following lower bounds for on-line computation. 1) Simulating two tape nondeterministic...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
DOI
Add to ORKG