Computational Complexity, slides 1 by Paul W. Goldberg (2023)
= Computational Complexity, slides 1 by Paul W. Goldberg (2023)
{c}
{tag=Work by Paul W. Goldberg}
{title2=2023}
https://www.cs.ox.ac.uk/people/paul.goldberg/CC/slides1.pdf
Hilary Term 2023 lecture slides. Slides 47–48, on PDF pp. 62–63, state the <linear speedup theorem> for $k>1$ tapes and explain the block simulation. The source is used for that general theorem, not as an answer key for an examination.