3.3 THE DEFINITION OF ALGORITHM Flashcards
What is an algorithm?
Informally speaking, an algorithm is a collection of simple instructions for carrying out some task.
In 1900, mathematician David Hilbert delivered a now-famous address at the International Congress of Mathematicians in Paris. In his lecture, he identified 23 mathematical problems and posed them as a challenge for the coming century. The tenth problem on his list ?
concerned algorithms.
What is a polynomial ?
A polynomial is a sum of terms, where each term is a product of certain variables and a constant, called a coefficient.
A root of a polynomial is ?
an assignment of values to its variables so that the value of the polynomial is 0.
When did the definition of algorithms arrive?
The definition came in the 1936 papers of Alonzo Church and Alan Turing. Church used a notational system called the λ-calculus to define algorithms.
What was the Church–Turing thesis?
Turing and Church both defined algorithms. This connection between the informal notion of algorithm and the precise definition has come to be called the Church–Turing thesis.