Classic Turing Machine with Tape Erasure | by Paul Fishwick | Creative Automata | Medium
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
A formalization of multi-tape Turing machines - ScienceDirect