Questions tagged [tape-complexity]
The tape-complexity tag has no usage guidance.
6
questions
1
vote
1
answer
180
views
Limited tapes-version TM for pair sum
In the problem of pair-sum we are given a multiset $A$ and a number $\alpha$. We are asked to find whether there is a pair ($2$ numbers) of $A$ s.t. their sum is $\alpha$. Here all numbers are small/...
- 113
1
vote
1
answer
121
views
Why the universal Turing machine simulation in O(TlogT) cannot be applied to transform multi-taped Turing machine into single-taped?
Recently, I've read Hennie's Paper. I understood the construction of buffer zones, but why can't it be applied to yield a single-taped Turing machine?
user93928
3
votes
1
answer
295
views
Multitape Turing machine with multiple non-blank tapes
A multitape Turing machine is defined to have input only appear on one tape, with the rest of the tapes blank.
Are there any formulations of a Turing machine that allow other tapes to be not blank? ...
- 143
1
vote
0
answers
744
views
K -> 2 tape reduction for nondeterministic Turing machines
How to I show that any language in NTIME(T(n)) can be accepted by a non-deterministic 2-tape O(T(n)) time-bounded Turing machine, with modifiable input tape?
I've seen the k to 2 tape reduction for ...
- 51
5
votes
1
answer
4k
views
Multitape Turing machines against single tape Turing machines
Introduction: I recently learned that a multi-tape Turing Machine $\text{TM}_k$ is no more "powerful" than a single tape Turing machine $\text{TM}$. The proof that $\text{TM}_k \equiv \text{TM}$ is ...
- 765
4
votes
1
answer
69
views
Why does it take $O(f(n)^2)$ to simulate a 3-tape $O(f(n))$-time TM on a 1-tape TM?
This looks like a fundamental result but I can't find a resource online that gives an intuitive interpretation of this complexity. Any basic explanation is appreciated.
- 493