A Way of Understanding What an Algorithm is via Turing’s Computable Numbers

2014-03-04

In 1936, Alan Turing wrote On Computable Numbers with an application to Entscheidungsproblem. In this paper, Turing formalised the concept of an algorithm by imagining it as a ‘mechanical processes’ that could be taught to machines, which have since come to be known as Turing machines. There are…