proof verification - Non-deterministic 2-tape Turing Machine to accept the language $L=\{x\#y \mid x,y \in \{0,1\}^\star, x \text{ is contained in } y\}$ - Mathematics Stack Exchange
9 Turing Machines | Modeling Computation
A general introduction to Turing Machine
Universal Turing machine - Wikipedia
L03_ChurchTuring
4.6. Multi tape Turing machines, simulation
complexity theory - Queries regarding simulation of multi-tape turing machine using single tape turing machine - Computer Science Stack Exchange