Skip to search formSkip to main contentSkip to account menu

Linear speedup theorem

Known as: Speedup theorem, Tape compression theorem 
In computational complexity theory, the linear speedup theorem for Turing machines states that given any real c > 0 and any Turing machine solving… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Computational complexity theoryLinear bounded automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Speeding-Up Cellular Automata by Alternations
There are two simple models of cellular automata: a semiinfinite array (with left boundary) of cells with sequential input mode… 
1995
1995
Characterizations of Realizable Space Complexities
1992
1992
Revisiting parallel speedup complexity
Two 'folk theorems' that permeate the parallel computation literature are reconsidered in this paper. The first of these, known… 
1978
1978
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines
1970
1970
R70-18 Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
The paper begins with a good formal introduction to iterative arrays, discussing briefly their relation to other automata… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)