Alan Mathison Turing, 1912-1954

@article{Newman1955AlanMT,
  title={Alan Mathison Turing, 1912-1954},
  author={M. H. A. Newman},
  journal={Biographical Memoirs of Fellows of the Royal Society},
  year={1955},
  pages={253 - 263}
}
  • M. Newman
  • Published 1 November 1955
  • Mathematics
  • Biographical Memoirs of Fellows of the Royal Society
The sudden death of Alan Turing on 7 June 1954 deprived mathematics and science of a great original mind at the height of its power. After some years of scientific indecision, since the end of the war, Turing had found, in his chemical theory of growth and form, a theme that gave the fullest scope for his rare combination of abilities, as a mathematical analyst with a flair for machine computing, and a natural philosopher full of bold original ideas. The preliminary report of 1952, and the… Expand
Alan Turing: Founder of Computer Science
TLDR
A biographical overview of Alan Turing, the 20th century mathematician, philosopher and early computer scientist, is presented and his subsequent influence is considered, both scientifically and culturally. Expand
Alan Turing and the Mathematical Objection
TLDR
Logico-mathematical reasons, stemming from his own work, helped to convince Alan Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. Expand
The Impact of Alan Turing: Formal Methods and Beyond
TLDR
The influence and reputation of Alan Turing since his death in 1954 is discussed, specifically in the field of formal methods, especially for program proving, but also in a much wider context. Expand
Turing on “Common Sense”: Cambridge Resonances
Turing was a philosopher of logic and mathematics, as well as a mathematician. His work throughout his life owed much to the Cambridge milieu in which he was educated and to which he returnedExpand
Alan turing and the other theory of computation
  • L. Blum
  • Computer Science
  • ITiCSE '12
  • 2012
TLDR
This talk recognizes Turing's work in the foundations of numerical computation, and indicates its role in complexity theory today, and how it provides a unifying concept for the two major traditions in the Theory of Computation. Expand
Alan Turing: ¿personaje del siglo XX?
“Time” magazine chose Albert Einstein as “Person of the Century.” This was undoubtedly a reasonable choice, but as I will argue in this article, there are also good reasons for contending that TuringExpand
A Turing Enigma
I describe my investigations into the highly-secret role that Alan Turing played during World War II, after his pre-war theoretical work on computability and the concept of a universal machine, inExpand
Review of Biographies of Alan Turing
2012 was the centennial of the birth of Alan Turing (1912–1954), and the centennial was the occasion for various celebrations, conferences, workshops, lectures, festivals, exhibitions, performances,Expand
Dystopia or utopia? Alan Turing’s Promethean ambition about intelligent machines
Writing in 1948, Turing felt compelled to confront a “religious belief” that “any attempt” to construct intelligent machines was seen “a sort of Promethean irreverence.” And yet he has beenExpand
On Mathematicians Who Liked Logic - The Case of Max Newman
TLDR
The case of Max Newman is reviewed in some detail; the rather surprising origins and development of his interest in logic are recorded; they included a lecture course at Cambridge University, which was attended in 1935 by Alan Turing. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 13 REFERENCES
A Formal Theorem in Church's Theory of Types
TLDR
A formal proof of Y α is now given for all types α containing ι, but the proof uses, in addition to Axioms 1 to 7 and Y ι , also Axiom 9 (in connection with Def. 4), and Axiom 10 (in Theorem 9). Expand
Some Calculations of the Riemann Zeta-Function
Introduction IN June 1950 the Manchester University Mark 1 Electronic Computer was used to do some calculations concerned with the distribution of the zeros of the Riemann zeta-function. It wasExpand
The Use of Dots as Brackets in Church's System
  • A. Turing
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1942
TLDR
The present note has been written in the belief that Church's formulation of the simple theory of types' is particularly suitable as a basis for work on that theory, and that it is therefore worth while introducing special conventions which take into account the needs of this particular system. Expand
The chemical basis of morphogenesis
  • A. Turing
  • Mathematics
  • Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences
  • 1952
It is suggested that a system of chemical substances, called morphogens, reacting together and diffusing through a tissue, is adequate to account for the main phenomena of morphogenesis. Such aExpand
Computability and λ-Definability
  • A. Turing
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1937
TLDR
The purpose of the present paper is to show that the computable functions introduced by the author are identical with the λ-definable functions of Church and the general recursive functions due to Herbrand and Godel and developed by Kleene. Expand
The þ-function in λ- K -conversion
In the theory of conversion it is important to have a formally defined function which assigns to any positive integer n the least integer not less than n which has a given property. The definition ofExpand
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
Finite Approximations to Lie Groups
A certain sense in which a finite group may be said to approximate the structure of a metrical group will be discussed. On account of Jordan's theorem on finite groups of linear transformations' itExpand
THE WORD PROBLEM IN SEMI-GROUPS WITH CANCELLATION
It will be shown that the word problem in semi-groups with cancellation is not solvable. The method depends on reducing the unsolvability of the problem in question to a known unsolvable problemExpand
Practical Forms of Type Theory
  • A. Turing
  • Philosophy, Computer Science
  • J. Symb. Log.
  • 1948
TLDR
This work disprove not only that the famous embedded algorithm for the improvement of model checking by Ivan Sutherland et al. is optimal, but that the same is true for cache coherence. Expand
...
1
2
...