What is <M>? A short discussion of encoding machines as strings.

Non deterministic turing machines and their equivalence to single-tape turing machines. Computation tree and address mapping discussed.

Multitape turing machines and their equivalence to single-tape turing machines.

A clear explanation of Turing Recognizable, Decidable and Enumerable languages and the relationships between them.

The concept of configurations of a Turing Machine and how they change based on different transitions. The notion of computation is also discussed.

A worked-out example of a high-level (implementat) description of a Turing Machine to recognize a language.

A worked-out example of a low-level (formal) description of a Turing Machine to recognize a language.

A look into different Turing Machine transitions and how they affect the tape. Notations explained.

The formal definition of a Turing Machine and some observations are discussed.

This article explores a step by step approach to prove that a language is not regular by using the Closure Properties of Regular languages.