Turing Machine Part 1: Basic Problems and the Language L = {0^n 1^n}

An introduction to Turing machine problems, focusing on simple examples and the language L = {0^n 1^n} in the theory of computation.