Turing Award

Named after Alan Turing AM Turing Award is given annually by the Association for Computing Machinery (ACM ) to persons who have made an outstanding contribution to the development of computer science. He is considered the highest honor in computer science, comparable to the Nobel Prize or the Fields Medal.

Expiration

A nomination for the Turing Award may make anybody, but it has in addition to a resume of the nominee and a motivation letter ( 200-500 words ) and at least three letters substantial supporters of prominent representative as possible of each discipline included. Although long-term effects of creativity are taken into account, the nominee should have achieved an emphasized individual performance. Proposals will be evaluated in a Committee, which will normally include the several previous winners belong.

Is awarded the Award at the annual ACM Awards Banquet each of the years before. The winners speak at their award ceremony on any ACM conference a special lecture, the Turing Award Lecture, in which they express their views and experiences in key areas of computer science.

Since 2007, the Turing Award is endowed with $ 250,000, sponsored by Intel and Google. Four years earlier, the prize money of 25,000 was increased to $ 100,000.

Award winners

The first prize winner was Alan J. Perlis 1966. By Frances E. Allen 40 years later received the first woman to the award. In 1975, the price for the first time to more than one person (Allen Newell and Herbert A. Simon, which dealt with artificial intelligence ).

About two thirds of awards went to American citizens.

  • LCF, probably the first theoretically sound and practically usable theorem prover
  • ML, the first programming language with a polymorphic type inference and type-safe exception handling
  • CCS, a general theory of concurrency

Turing Centenary Celebration

In May 2012, 100 years after Alan Turing's birth, 33 winners of the Turing Award met for the ACM Turing Centenary Celebration in San Francisco to be in lectures and panel discussions on topics such as information, Data, Security in a Networked Future or on Algorithmic View of the Universe exchange.

Alan Perlis Compiler Maurice Wilkes Electronic Delay Storage Automatic Calculator James H. Wilkinson Linear algebra John McCarthy (computer scientist) Charles Bachman Donald Knuth Michael O. Rabin Israel Parsing Semantics (computer science) Kenneth E. Iverson APL (programming language) Stephen Cook Niklaus Wirth Euler (programming language) Algol W Richard M. Karp Time complexity#Polynomial time John Cocke Sketchpad IEEE 854-1987 Compatible Time-Sharing System ML (programming language) Manuel Blum Amir Pnueli Computability theory Simula Kristen Nygaard Ron Rivest Public-key cryptography Adi Shamir Xerox Alto Dynabook E. Allen Emerson Joseph Sifakis Charles P. Thacker Machine learning Judea Pearl Shafi Goldwasser Leslie Lamport
20822
de