The Halting Problem


Virtual Assistant, Web Design and bookkeeping services

The Halting Problem is the problem of deciding whether a computer program will finish or go on forever. It is an example of a decision problem, a problem where you have a yes or no and it’s one of the key results in the theory of computation. It’s easy to formulate and impossible to solve using the Turing Machine. And what is important about the Halting Problem was that inside it there was a formal definition of what a computer is and what a piece of software or computer program was.

You May Also Like…

Computational complexity

Computational complexity

Developed in the 70's, computational complexity is a subbranch of the theory of computation. The latter was...

The Turing Machine

The Turing Machine

The Turing Machine is a model of computation which is reflected in every sort of computer we use today: the computer...


Submit a Comment

Your email address will not be published. Required fields are marked *