It's a little easier to see how to build a universal Turing machine if we use a three-tape Turing machine. Again, since the tape alphabet of the emulated Turing machine may be larger than the tape alphabet of our universal Turing machine, we may need to encode the alphabet. We have already noted that a multitape Turing machine is equivalent to a standard Turing machine. In fact, once you get into the details, it's probably easier to do on a single-tape machine. We will not complete the development of a universal Turing machine, but it isn't as difficult as you might think.
Some people have too much time on their hands.