2-tape nondeterministic TM

From: RJL (lorentz-nospam-_at_csun.edu)
Date: 03/02/05 

Date: Wed, 02 Mar 2005 10:29:59 -0800

Problem 2.8.17 in Papadimitriou's Computational Complexity asks to show
that any language decided by a k-tape nondeterministic TM can be decided
by a 2-tape NTM with no loss of time. Well, I'm stumped and so are all
the students in my class. All the more frustrating is the fact that he
states that it has a "simple solution." Can anyone help us out here?
Perhaps it's best to email me directly so as not to reveal the solution
to a good problem to too many people! Thanks!

-Richard Lorentz
lorentz-snip-@-snip-csun.edu