DOIAbstract
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time n(log n)1/(k+1)
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time n(log n)1/(k+1)
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThe class of functions computed within any time bound greater than nlog logn by a single tap...
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterminis...
AbstractWe present almost matching upper and lower time bounds for the simulation of Turing machines...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
A computation of a single tape Turing machine can be simulated by a probabilistic random access mach...
AbstractWe show that if the number of available states is fixed and is sufficiently large, then one-...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
Add to ORKG