The Halting problem

We learn about the halting problem in computability theory. It is as follows, Given an algorithm and its initial input, we determine if the algorithm when executed in this input will ever stop/halt. If it does not halt, it runs forever in an infinite loop.

Table of contents.Introduction.Proving the halting problem.Reduction and consequences.Summary.References.Introduction.

In computability theory we describe the halting problem as follows;
Given an algorithm and its initial input, we det...