AbstractThe class of functions computed within any time bound greater than nlog logn by a single tape Turing machine is strictly contained within the class of functions computed by a Random Access Machine in the same time according to the logarithmic cost criterion
The notion of linear-time computability is very sensitive to machine model. In this connection, we i...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
The RAM, an abstract model for a random access computer, is introduced. A unique feature of the mode...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
The relative power of several computational models is considered. These models are the Turing machin...
AbstractEvery t(n)-time bounded RAM (assuming the logarithmic cost measure) can be simulated by a t(...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
The notion of linear-time computability is very sensitive to machine model. In this connection, we i...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
The RAM, an abstract model for a random access computer, is introduced. A unique feature of the mode...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
The relative power of several computational models is considered. These models are the Turing machin...
AbstractEvery t(n)-time bounded RAM (assuming the logarithmic cost measure) can be simulated by a t(...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
The notion of linear-time computability is very sensitive to machine model. In this connection, we i...
We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Tu...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
DOI
Add to ORKG