Robin Gandy

Robin Gandy

Robin Oliver Gandy (22 September 1919 - 20 November1995) was a British mathematician and logician.

He was a friend, student, and associate of Alan Turing, having been supervised by Turing during his PhD at the University of Cambridge (graduated 1953), where they worked together.

Educated at Abbotsholme, Robin took two years of the Mathematical Tripos, at King's College, Cambridge, before enlisting for military service in 1940. During World War II he became involved in work with Alan Turing, on a speech encipherment project at Hanslope Park, and became one of Turing's lifelong friends and associates. In 1946, he completed Part 3 of the Mathematical Tripos, then began studying for a PhD under Turing's supervision. He completed his thesis, "On axiomatic systems in mathematics and theories in Physics", in 1952. He was a member of the Apostles.

Gandy held positions at the Universities of Leicester, Leeds, and Manchester. Gandy was a visiting associate professor at Stanford from 1966 to 1967, and held a similar position at University of California, Los Angeles in 1968. In 1969 he moved to Wolfson College, Oxford, where he became Reader in Mathematical Logic. One of the residential buildings of the college is now named in his honour.

He is best-known for his work in recursion theory. His contributions include the Spector-Gandy theorem, the Gandy Stage Comparison theorem, and the Gandy Selection Theorem.

External links

* [http://www.turing.org.uk/turing/scrapbook/robin.html Robin Gandy - The Alan Turing Scrapbook]
* [http://www.genealogy.math.ndsu.nodak.edu/html/id.phtml?id=36415 Robin Gandy - The Mathematics Genealogy Project]

References

*
*
*


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Robin Gandy — Robin Oliver Gandy (* 22. September 1919 in Peppard, Oxfordshire; † 20. November 1995 in Oxford) war ein britischer Logiker. Gandy begann noch vor dem Zweiten Weltkrieg ein Studium der Mathematik und Philosophie am King’s College der Cambridge… …   Deutsch Wikipedia

  • Gandy — ist der Name folgender Personen: Ellen Gandy, britische Schwimmerin Harry Gandy (1881–1957), US amerikanischer Politiker John Peter Gandy (1787–1850), britischer Architekt Joseph Gandy (1771–1843), britischer Künstler und Architekt Michael Joseph …   Deutsch Wikipedia

  • Gandy (surname) — Gandy is a surname, and may refer to: * Dylan Gandy, American football player * George Gandy, American entrepreneur * Helen Gandy, American civil servant * John Peter Gandy, British architect * Joseph Michael Gandy, British artist * Kim Gandy,… …   Wikipedia

  • History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

  • Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… …   Wikipedia

  • History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

  • Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… …   Wikipedia

  • Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Alan Turing — Turing redirects here. For other uses, see Turing (disambiguation). Alan Turing Turing at the time of his election to Fellowship of the Royal Society …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”