Understanding and Designing Turing Machines with Applications to Computing

Alan Turing was a pioneer in the computability theory. This theory has its origins from the fields of mathematical logic, theory of computation and computer science. In 1936, Turing introduced the concept of an automatic machine called since then as “Turing Machine”. This concept set strong foundations by helping to define computable functions and algorithms. A Turing machine is a mathematical model of computation. This model describes an abstract machine that handles symbols on a computer tape according to a set of rules. With the help of Turing machines, it is achievable by researchers to design and implement any computer algorithm. This paper tries to contribute to a better understanding of Turing machines and their utilization in Algorithms Theory.