AN EASIER WAY TO UNDERSTAND THE UNDECIDABILITY OF HALTING PROBLEM OF TURING MACHINES

Abstract

This paper provides us an easier way to understand the undecidability of the halting problem of Turing machines. Our way is easier because author moves forward by discussing some past concepts in an easier way. The concept of Cantor’s diagonal argument has been discussed in an easier and simpler way that then helps us in understanding the undecidability of the halting problem of Turing machines.