Information about Acm Turing Award
The A.M. Turing Award is given annually by the Association for Computing Machinery to
a person selected for contributions of a technical nature made to the computing community.
The contributions should be of lasting and major technical importance to the
computer field. Most of the recipients have been computer scientists.
The award is named after Alan Mathison Turing, a British mathematician considered to be one of the fathers of modern computer science.
The Turing Award is often recognized as the "Nobel Prize of computing". It is co-sponsored by Intel Corporation and Google and currently accompanied by a prize of $250,000. It was originally solely sponsored by Intel and accompanied by a prize of $100,000.
The award recipients and the fields in which they earned the recognition are listed below. Refer to the individual recipients for more detailed information on their achievements.
The award is named after Alan Mathison Turing, a British mathematician considered to be one of the fathers of modern computer science.
The Turing Award is often recognized as the "Nobel Prize of computing". It is co-sponsored by Intel Corporation and Google and currently accompanied by a prize of $250,000. It was originally solely sponsored by Intel and accompanied by a prize of $100,000.
The award recipients and the fields in which they earned the recognition are listed below. Refer to the individual recipients for more detailed information on their achievements.
Turing Award recipients
| Year | Recipients | Citation |
|---|---|---|
| 1966 | Alan J. Perlis | For his influence in the area of advanced programming techniques and compiler construction |
| 1967 | Maurice V. Wilkes | Professor Wilkes is best known as the builder and designer of the EDSAC, the first computer with an internally stored program. Built in 1949, the EDSAC used a mercury delay line memory. He is also known as the author, with Wheeler and Gill, of a volume on "Preparation of Programs for Electronic Digital Computers" in 1951, in which program libraries were effectively introduced |
| 1968 | Richard Hamming | For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes |
| 1969 | Marvin Minsky | artificial intelligence |
| 1970 | James H. Wilkinson | For his research in numerical analysis to facilitate the use of the high-speed digital computer, having received special recognition for his work in computations in linear algebra and "backward" error analysis |
| 1971 | John McCarthy | Dr. McCarthy's lecture "The Present State of Research on Artificial Intelligence" is a topic that covers the area in which he has achieved considerable recognition for his work |
| 1972 | Edsger Dijkstra | Edsger Dijkstra was a principal contributor in the late 1950's to the development of the ALGOL, a high level programming language which has become a model of clarity and mathematical rigor. He is one of the principal exponents of the science and art of programming languages in general, and has greatly contributed to our understanding of their structure, representation, and implementation. His fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the field of programming languages |
| 1973 | Charles W. Bachman | For his outstanding contributions to database technology |
| 1974 | Donald E. Knuth | For his major contributions to the analysis of algorithms and the design of programming languages, and in particular for his contributions to "The Art of Computer Programming" through his well-known books in a continuous series by this title |
| 1975 | Allen Newell and Herbert A. Simon | In joint scientific efforts extending over twenty years, initially in collaboration with J. C. Shaw at the RAND Corporation, and subsequentially with numerous faculty and student colleagues at Carnegie Mellon University, they have made basic contributions to artificial intelligence, the psychology of human cognition, and list processing |
| 1976 | Michael O. Rabin and Dana S. Scott | For their joint paper "Finite Automata and Their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field |
| 1977 | John Backus | For profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on FORTRAN, and for seminal publication of formal procedures for the specification of programming languages |
| 1978 | Robert W. Floyd | For having a clear influence on methodologies for the creation of efficient and reliable software, and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic program synthesis, and analysis of algorithms |
| 1979 | Kenneth E. Iverson | For his pioneering effort in programming languages and mathematical notation resulting in what the computing field now knows as APL, for his contributions to the implementation of interactive systems, to educational uses of APL, and to programming language theory and practice |
| 1980 | C. Antony R. Hoare | For his fundamental contributions to the definition and design of programming languages |
| 1981 | Edgar F. Codd | For his fundamental and continuing contributions to the theory and practice of database management systems, esp. relational databases |
| 1982 | Stephen A. Cook | For his advancement of our understanding of the complexity of computation in a significant and profound way |
| 1983 | Ken Thompson and Dennis M. Ritchie | For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system |
| 1984 | Niklaus Wirth | For developing a sequence of innovative computer languages, EULER, ALGOL-W, MODULA and PASCAL |
| 1985 | Richard M. Karp | For his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness |
| 1986 | John Hopcroft and Robert Tarjan | For fundamental achievements in the design and analysis of algorithms and data structures |
| 1987 | John Cocke | For significant contributions in the design and theory of compilers, the architecture of large systems and the development of reduced instruction set computers (RISC) |
| 1988 | Ivan Sutherland | For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after |
| 1989 | William (Velvel) Kahan | For his fundamental contributions to numerical analysis. One of the foremost experts on floating-point computations. Kahan has dedicated himself to "making the world safe for numerical computations." |
| 1990 | Fernando J. Corbató | For his pioneering work organizing the concepts and leading the development of the general-purpose, large-scale, time-sharing and resource-sharing computer systems, CTSS and Multics. |
| 1991 | Robin Milner | For three distinct and complete achievements: 1) LCF, the mechanization of Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool for machine assisted proof construction; 2) ML, the first language to include polymorphic type inference together with a type-safe exception-handling mechanism; 3) CCS, a general theory of concurrency. In addition, he formulated and strongly advanced full abstraction, the study of the relationship between operational and denotational semantics. |
| 1992 | Butler W. Lampson | For contributions to the development of distributed, personal computing environments and the technology for their implementation: workstations, networks, operating systems, programming systems, displays, security and document publishing. |
| 1993 | Juris Hartmanis and Richard E. Stearns | In recognition of their seminal paper which established the foundations for the field of computational complexity theory. |
| 1994 | Edward Feigenbaum and Raj Reddy | For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology. |
| 1995 | Manuel Blum | In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking. |
| 1996 | Amir Pnueli | For seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification. |
| 1997 | Douglas Engelbart | For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision. |
| 1998 | Jim Gray | For seminal contributions to database and transaction processing research and technical leadership in system implementation. |
| 1999 | Frederick P. Brooks, Jr. | For landmark contributions to computer architecture, operating systems, and software engineering. |
| 2000 | Andrew Chi-Chih Yao | In recognition of his fundamental contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. |
| 2001 | Ole-Johan Dahl and Kristen Nygaard | For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I and Simula 67. |
| 2002 | Ronald L. Rivest, Adi Shamir and Leonard M. Adleman | For their ingenious contribution for making public-key cryptography useful in practice. |
| 2003 | Alan Kay | For pioneering many of the ideas at the root of contemporary object-oriented programming languages, leading the team that developed Smalltalk, and for fundamental contributions to personal computing. |
| 2004 | Vinton G. Cerf and Robert E. Kahn | For pioneering work on internetworking, including the design and implementation of the Internet's basic communications protocols, TCP/IP, and for inspired leadership in networking. |
| 2005 | Peter Naur | For fundamental contributions to programming language design and the definition of Algol 60, to compiler design, and to the art and practice of computer programming. |
| 2006 | Frances E. Allen | For contributions that fundamentally improved the performance of computer programs in solving problems, and accelerated the use of high performance computing. |
External links
A.M. Turing Award Laureates |
|---|
Perlis (1966) •
Wilkes (1967) •
Hamming (1968) •
Minsky (1969) •
Wilkinson (1970) •
McCarthy (1971) •
Dijkstra (1972) •
Bachman (1973) •
Knuth (1974) •
Newell / Simon (1975) •
Rabin / Scott (1976) •
Backus (1977) •
Floyd (1978) •
Iverson (1979) •
Hoare (1980) •
Codd (1981) •
Cook (1982) •
Thompson / Ritchie (1983) •
Wirth (1984) •
Karp (1985) •
Hopcroft / Tarjan (1986) •
Cocke (1987) •
Sutherland (1988) •
Kahan (1989) •
Corbat (1990) •
Milner (1991) •
Lampson (1992) •
Hartmanis / Stearns (1993) •
Feigenbaum / Reddy (1994) •
Blum (1995) •
Pnueli (1996) •
Engelbart (1997) •
Gray (1998) •
Brooks (1999) •
Yao (2000) •
Dahl / Nygaard (2001) •
Rivest / Shamir / Adleman (2002) •
Kay (2003) •
Cerf / Kahn (2004) •
Naur (2005) •
Allen (2006)
|
Association for Computing Machinery
Formation 1947
Headquarters New York, NY
Membership 83,000
President Stuart Feldman
Website [1]
The Association for Computing Machinery, or ACM
..... Click the link for more information.
Formation 1947
Headquarters New York, NY
Membership 83,000
President Stuart Feldman
Website [1]
The Association for Computing Machinery, or ACM
..... Click the link for more information.
computing is synonymous with counting and calculating. Originally, people that performed these functions were known as computers. Today it refers to a science and technology that deals with the computation and the manipulation of symbols.
..... Click the link for more information.
..... Click the link for more information.
Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems.
..... Click the link for more information.
..... Click the link for more information.
Alan Mathison Turing, OBE, FRS (23 June 1912 – 7 June 1954) was an English mathematician, logician, and cryptographer.
Turing is often considered to be the father of modern computer science.
..... Click the link for more information.
Turing is often considered to be the father of modern computer science.
..... Click the link for more information.
Motto
"Dieu et mon droit" [2] (French)
"God and my right"
Anthem
"God Save the Queen" [3]
..... Click the link for more information.
"Dieu et mon droit" [2] (French)
"God and my right"
Anthem
"God Save the Queen" [3]
..... Click the link for more information.
Mathematics (colloquially, maths or math) is the body of knowledge centered on such concepts as quantity, structure, space, and change, and also the academic discipline that studies them. Benjamin Peirce called it "the science that draws necessary conclusions".
..... Click the link for more information.
..... Click the link for more information.
Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems.
..... Click the link for more information.
..... Click the link for more information.
This page is currently protected from editing until disputes have been resolved.
Protection is not an endorsement of the current [ version] ([ protection log]).
..... Click the link for more information.
Protection is not an endorsement of the current [ version] ([ protection log]).
..... Click the link for more information.
Intel Corporation
Public (NASDAQ: INTC , SEHK: 4335 )
Founded 1968 1
Headquarters Santa Clara, California
United States
Key people Paul S.
..... Click the link for more information.
Public (NASDAQ: INTC , SEHK: 4335 )
Founded 1968 1
Headquarters Santa Clara, California
United States
Key people Paul S.
..... Click the link for more information.
Google Inc.
Public (NASDAQ: GOOG ), (LSE: GGEA )
Founded Menlo Park, California (September 7 1998[1])
Headquarters Mountain View, California, USA
Key people Eric E.
..... Click the link for more information.
Public (NASDAQ: GOOG ), (LSE: GGEA )
Founded Menlo Park, California (September 7 1998[1])
Headquarters Mountain View, California, USA
Key people Eric E.
..... Click the link for more information.
19th century - 20th century - 21st century
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1963 1964 1965 - 1966 - 1967 1968 1969
Year 1966 (MCMLXVI
..... Click the link for more information.
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1963 1964 1965 - 1966 - 1967 1968 1969
Year 1966 (MCMLXVI
..... Click the link for more information.
Alan Jay Perlis
Born March 1 1922
Pittsburgh, Pennsylvania, USA
Died January 7 1990 (aged 69)
..... Click the link for more information.
Born March 1 1922
Pittsburgh, Pennsylvania, USA
Died January 7 1990 (aged 69)
..... Click the link for more information.
Computer programming (often shortened to programming or coding) is the process of writing, testing, and maintaining the source code of computer programs. The source code is written in a programming language.
..... Click the link for more information.
..... Click the link for more information.
compiler is a computer program (or set of programs) that translates text written in a computer language (the source language) into another computer language (the target language).
..... Click the link for more information.
..... Click the link for more information.
19th century - 20th century - 21st century
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1964 1965 1966 - 1967 - 1968 1969 1970
Year 1967 (MCMLXVII
..... Click the link for more information.
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1964 1965 1966 - 1967 - 1968 1969 1970
Year 1967 (MCMLXVII
..... Click the link for more information.
should be added to this article, to conform with Wikipedia's Manual of Style.
Please discuss this issue on the talk page.
This article has been tagged since August 2007.
..... Click the link for more information.
Please discuss this issue on the talk page.
This article has been tagged since August 2007.
..... Click the link for more information.
A computer program is one or more instructions that are intended for execution by a computer. Specifically, it is a symbol or combination of symbols forming an algorithm that may or may not terminate, and that algorithm is written in a programming language.
..... Click the link for more information.
..... Click the link for more information.
Delay line memory was a form of computer memory used on some of the earliest digital computers. Like many modern forms of electronic computer memory, delay line memory was a refreshable memory, but as opposed to modern random access memory, delay line memory was serial
..... Click the link for more information.
..... Click the link for more information.
library is a collection of subprograms used to develop software. Libraries contain "helper" code and data, which provide services to independent programs. This allows code and data to be shared and changed in a modular fashion.
..... Click the link for more information.
..... Click the link for more information.
19th century - 20th century - 21st century
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1965 1966 1967 - 1968 - 1969 1970 1971
Year 1968 (MCMLXVIII
..... Click the link for more information.
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1965 1966 1967 - 1968 - 1969 1970 1971
Year 1968 (MCMLXVIII
..... Click the link for more information.
Richard Wesley Hamming
Born January 11 1915
Chicago, Illinois
Died January 7 1998 (aged 84)
Monterey, California
..... Click the link for more information.
Born January 11 1915
Chicago, Illinois
Died January 7 1998 (aged 84)
Monterey, California
..... Click the link for more information.
Numerical analysis is the study of algorithms for the problems of continuous mathematics (as distinguished from discrete mathematics).
One of the earliest mathematical writing is the Babylonian tablet YBC 7289, which gives a sexagesimal numerical approximation of ,
..... Click the link for more information.
One of the earliest mathematical writing is the Babylonian tablet YBC 7289, which gives a sexagesimal numerical approximation of ,
..... Click the link for more information.
19th century - 20th century - 21st century
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1966 1967 1968 - 1969 - 1970 1971 1972
..... Click the link for more information.
1930s 1940s 1950s - 1960s - 1970s 1980s 1990s
1966 1967 1968 - 1969 - 1970 1971 1972
- Also:
- *:1969 (number)
- *:
..... Click the link for more information.
Marvin Lee Minsky
Marvin Minsky in 2006
Born July 9 1927
New York City
..... Click the link for more information.
Marvin Minsky in 2006
Born July 9 1927
New York City
..... Click the link for more information.
artificial intelligence (or AI) is "the study and design of intelligent agents" where an intelligent agent is a system that perceives its environment and takes actions which maximizes its chances of success.
..... Click the link for more information.
..... Click the link for more information.
19th century - 20th century - 21st century
1940s 1950s 1960s - 1970s - 1980s 1990s 2000s
1967 1968 1969 - 1970 - 1971 1972 1973
Year 1970 (MCMLXX
..... Click the link for more information.
1940s 1950s 1960s - 1970s - 1980s 1990s 2000s
1967 1968 1969 - 1970 - 1971 1972 1973
Year 1970 (MCMLXX
..... Click the link for more information.
James Hardy Wilkinson
Born September 27 1919
Strood, England
Died September 5 1986 (aged 67)
Nationality English
..... Click the link for more information.
Born September 27 1919
Strood, England
Died September 5 1986 (aged 67)
Nationality English
..... Click the link for more information.
Numerical analysis is the study of algorithms for the problems of continuous mathematics (as distinguished from discrete mathematics).
One of the earliest mathematical writing is the Babylonian tablet YBC 7289, which gives a sexagesimal numerical approximation of ,
..... Click the link for more information.
One of the earliest mathematical writing is the Babylonian tablet YBC 7289, which gives a sexagesimal numerical approximation of ,
..... Click the link for more information.
Linear algebra is the branch of mathematics concerned with the study of vectors, vector spaces (also called linear spaces), linear maps (also called linear transformations), and systems of linear equations.
..... Click the link for more information.
..... Click the link for more information.
19th century - 20th century - 21st century
1940s 1950s 1960s - 1970s - 1980s 1990s 2000s
1968 1969 1970 - 1971 - 1972 1973 1974
Year 1971 (MCMLXXI
..... Click the link for more information.
1940s 1950s 1960s - 1970s - 1980s 1990s 2000s
1968 1969 1970 - 1971 - 1972 1973 1974
Year 1971 (MCMLXXI
..... Click the link for more information.
This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus