English computer scientist (1912–1954)
Alan Mathison Turing (23 June 1912 – 7 June 1954) was an English mathematician, computer scientist, logician, cryptanalyst, philosopher, and theoretical biologist. Turing was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. Turing is widely considered to be the father of theoretical computer science and artificial intelligence.
Bio from: Wikiquote (CC BY-SA 4.0)
From Wikidata (CC0)
The popular view that scientists proceed inexorably from well-established fact to well-established fact, never being influenced by any unproved conjecture, is quite mistaken. Provided it is made clear which are proved facts and which are conjectures, no harm can result. Conjectures are of great importance since they suggest useful lines of research.
Mathematical reasoning may be regarded rather schematically as the exercise of a combination of two faculties, which we may call intuition and ingenuity.
... In pre-Gödel times it was thought by some that all the intuitive judgements of mathematics could be replaced by a finite number of rules. The necessity for intuition would then be entirely eliminated.
In our discussions, however, we have gone to the opposite extreme and eliminated not intuition but ingenuity, and this in spite of the fact that our aim has been in much the same direction.
For some purposes we might use machines (choice... or c-machines) whose motion is only partially determined by the configuration... When such a machine reaches... ambiguous configurations, it cannot go on until some arbitrary choice has been made by an external operator. This would be the case if we were using machines to deal with axiomatic systems.
[...] Queste difficoltà possono essere risolte nel modo migliore facendo buon viso a cattivo gioco. I ritardi possono essere tollerati accettandoli ed elaborando una scansione temporale che li preveda. Si può poi tollerare una certa imprecisione nella risposta pensando in termini di <>. Così invece di dire: <>, noi diremo: <>. Le varie classi devono essere del tutto distinte e ben lontane dal sovrapporsi, cioé - topologicamente parlando - potremmo dire che devono avere tra loro una distanza finita. Con una decisione del genere avremo introdotto una ben definita divisione del lavoro tra il matematico e l'ingegnere, che permetterà a ognuno dei due di andare avanti senza preoccuparsi se le sue assunzioni siano in accordo con quelle dell'altro.
Can machines think?"... The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart from the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B... We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?"
The view that machines cannot give rise to surprises is due, I believe, to a fallacy to which philosophers and mathematicians are particularly subject. This is the assumption that as soon as a fact is presented to a mind all consequences of that fact spring into the mind simultaneously with it. It is a very useful assumption under many circumstances, but one too easily forgets that it is false. A natural consequence of doing so is that one then assumes that there is no virtue in the mere working out of consequences from data and general principles.