The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) to "an individual selected for contributions of a technical nature made to the computing community". It is stipulated that "The contributions should be of lasting and major technical importance to the computer field".^[1] The Turing Award is recognized as the "highest distinction in Computer science"^[2] and "Nobel Prize of computing".^[3]

The award is named after Alan Turing, mathematician and reader in mathematics at the University of Manchester. Turing is "frequently credited for being the Father of theoretical computer science and artificial intelligence".^[4] As of 2007, the award is accompanied by a prize of $250,000, with financial support provided by Intel and Google.^[1]

The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. Frances E. Allen of IBM, in 2006, was the first female recipient in the award's forty year history.^[5][6][7] The 2008 award also went to a woman, Barbara Liskov.

Recipients[link]

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	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 W. Dijkstra	Edsger Dijkstra was a principal contributor in the late 1950s 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 proponents 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 pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution.
2007	Edmund M. Clarke, E. Allen Emerson and Joseph Sifakis	For [their roles] in developing model checking into a highly effective verification technology, widely adopted in the hardware and software industries.[8]
2008	Barbara Liskov	For contributions to practical and theoretical foundations of programming language and system design, especially related to data abstraction, fault tolerance, and distributed computing.
2009	Charles P. Thacker	For his pioneering design and realization of the Xerox Alto, the first modern personal computer, and in addition for his contributions to the Ethernet and the Tablet PC.
2010	Leslie G. Valiant	For transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.
2011	Judea Pearl	For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.[9]

See also[link]

• List of Turing Award laureates by university affiliation

References[link]

External links[link]

Wikimedia Commons has media related to: Turing Award

• ACM List of Turing Laureates
• Bibliography of Turing Award lectures (through 2000)

Stephen Arthur Cook
Born	(1939-12-14) December 14, 1939 (age 72) Buffalo, New York
Fields	Computer Science
Institutions	University of California, Berkeley University of Toronto
Alma mater	Harvard University University of Michigan
Doctoral advisor	Hao Wang
Doctoral students	Paul Beame Mark Braverman Valentine Kabanets Toniann Pitassi Robert A. Reckhow Walter Savitch
Known for	NP-completeness Propositional proof complexity Cook-Levin theorem
Notable awards	Turing Award CRM-Fields-PIMS prize John L. Synge Award Bernard Bolzano Medal

Stephen Arthur Cook (born December 14, 1939, Buffalo, New York) is a renowned American-Canadian computer scientist and mathematician who has made major contributions to the fields of complexity theory and proof complexity. He is currently a University Professor at the University of Toronto, Department of Computer Science and Department of Mathematics.

Biography[link]

Cook received his Bachelor's degree in 1961 from the University of Michigan, and his Master's degree and Ph.D. from Harvard University, respectively in 1962 and 1966. He joined the University of California, Berkeley, mathematics department in 1966 as an Assistant Professor, and stayed there until 1970 when he was denied reappointment. In a speech celebrating the 30th anniversary of the Berkeley EECS department, fellow Turing Award winner and Berkeley professor Richard Karp said that, "It is to our everlasting shame that we were unable to persuade the math department to give him tenure."^[1] Cook joined the faculty of University of Toronto, Computer Science and Mathematics Departments in 1970 as an Associate Professor, where he was promoted to Professor in 1975 and University Professor in 1985.

Research[link]

Cook is considered one of the forefathers of computational complexity theory.

During his PhD, Cook worked on complexity of functions, mainly on multiplication. He received his PhD in 1966. A few years later, in his seminal 1971 paper "The Complexity of Theorem Proving Procedures",^[2][3] Cook formalized the notions of polynomial-time reduction (a.k.a. Cook reduction) and NP-completeness, and proved the existence of an NP-complete problem by showing that the Boolean satisfiability problem (usually known as SAT) is NP-complete. This theorem was proven independently by Leonid Levin in the Soviet Union, and has thus been given the name the Cook-Levin theorem. The paper also formulated the most famous problem in computer science, the P vs. NP problem. Informally, the "P vs. NP" question asks whether every optimization problem whose answers can be efficiently verified for correctness/optimality can be solved optimally with an efficient algorithm. Given the abundance of such optimization problems in everyday life, a positive answer to the "P vs. NP" question would likely have profound practical and philosophical consequences.

Cook conjectures that there are optimization problems (with easily checkable solutions) which cannot be solved by efficient algorithms, i.e., P is not equal to NP. This conjecture has generated a great deal of research in computational complexity theory, which has considerably improved our understanding of the inherent difficulty of computational problems and what can be computed efficiently. Yet, the conjecture remains open and is among the seven famous Millennium Prize Problems.^[4][5]

In 1982, Cook received the prestigious Turing award for his contributions to complexity theory. His citation reads:

For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade.

In his "Feasibly Constructive Proofs and the Propositional Calculus"^[6] paper published in 1975, he introduced the equational theory PV (standing for Polynomial-time Verifiable) to formalize the notion of proofs using only polynomial-time concepts. He made another major contribution to the field in his 1979 paper, joint with his student Robert A. Reckhow, "The Relative Efficiency of Propositional Proof Systems",^[7] in which they formalized the notions of p-simulation and efficient propositional proof system, which started an area now called propositional proof complexity. They proved that the existence of a proof system in which every true formula has a short proof is equivalent to NP = coNP. Cook co-authored a book with his student Phuong The Nguyen in this area titled "Logical Foundations of Proof Complexity".^[8]

His main research areas are complexity theory and proof complexity, with excursions into programming language semantics, parallel computation, and artificial intelligence. Other areas which he has contributed to include bounded arithmetic, bounded reverse mathematics, complexity of higher type functions, complexity of analysis, and lower bounds in propositional proof systems.

Awards and honors[link]

Cook was awarded a Steacie Fellowship in 1977, a Killam Research Fellowship in 1982, and received the CRM-Fields-PIMS prize in 1999. He has won John L. Synge Award and Bernard Bolzano Medal, and is a fellow of the Royal Society of London and Royal Society of Canada. Cook was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences. Association for Computing Machinery honored him as a Fellow of ACM in 2008 for his fundamental contributions to the theory of computational complexity.^[9] He was awarded the ACM Turing Award in 1982.

Cook has supervised numerous MSc students, and 30 PhD students have completed their degrees under his supervision.

Personal life[link]

Cook has two children and currently lives with his wife in Toronto. He plays the violin and enjoys sailing.

References[link]

1. ^ A Personal View of Computer Science at Berkeley - Richard Karp
2. ^ "The Complexity of Theorem Proving Procedures", PDF file of a scanned version
3. ^ "The Complexity of Theorem Proving Procedures", PDF file of a retyped version
4. ^ P vs. NP problem on Millennium Prize Problems page - Clay Mathematics Institute
5. ^ P vs. NP problem's official description by Stephen Cook on Millennium Prize Problems
6. ^ "Feasibly Constructive Proofs and the Propositional Calculus" on ACM
7. ^ "The Relative Efficiency of Propositional Proof Systems" on JStore
8. ^ "Logical Foundations of Proof Complexity"'s official page
9. ^ Stephen Cook on ACM Fellows

External links[link]

• Home page of Stephen A. Cook
• Oral history interview with Stephen Cook at Charles Babbage Institute, University of Minnesota. Cook discussed his education at the University of Michigan and Harvard University and early work at the University of California, Berkeley, and his growing interest in problems of computational complexity. Cook recounted his move to the University of Toronto in 1970 and the reception of his work on NP-completeness, leading up to his A.M. Turing Award.
• Stephen Cook at the Mathematics Genealogy Project
• Stephen Cook at DBLP

Gallery[link]

• 

  Professors Cook and Krajíček at the Fall school of Logic & Complexity in Prague, September 24, 2008

Kenneth Lane Thompson
Thompson (left) with Dennis Ritchie.
Born	(1943-02-04) February 4, 1943 (age 69) New Orleans, Louisiana, U.S.A.
Nationality	United States of America
Fields	Computer Science
Institutions	Bell Labs Entrisphere, Inc Google Inc.
Alma mater	University of California, Berkeley
Known for	Unix B (programming language) Belle (chess machine) UTF-8 Endgame tablebase
Notable awards	Turing Award National Medal of Technology Tsutomu Kanai Award

Kenneth Lane Thompson (born February 4, 1943), commonly referred to as ken in hacker circles,^[1] is an American pioneer of computer science. Having worked at Bell Labs for most of his career, Thompson is notable for his work with the B programming language (basing it mainly on the BCPL language he had used to write Unix while in the MULTICS project), the C programming language, and as one of the creators and early developers of the Unix and Plan 9 operating systems.

Other notable contributions included his work on regular expressions and early computer text editors QED and ed, his work on computer chess that included creation of endgame tablebases and the chess machine Belle, and most recently the co-creation of Google's programming language Go.

Biography[link]

Thompson was born in New Orleans. He received a Bachelor of Science in 1965 and a master's degree in 1966, both in Electrical Engineering and Computer Science, from the University of California, Berkeley, where his master's thesis advisor was Elwyn Berlekamp.^[2]

In the 1960s, Thompson and Dennis Ritchie worked on the Multics operating system. While writing Multics, Thompson created the Bon programming language. The two left the Multics project when Bell Labs withdrew from it, but they used the experience from the project, and in 1969, Thompson and Ritchie became the principal creators of the Unix operating system. At this time, Thompson decided that Unix needed a system programming language and created B, a precursor to Ritchie's C.^[3]

Thompson had developed the CTSS version of the editor QED, which included regular expressions for searching text. QED and Thompson's later editor ed (the default editor on Unix) contributed greatly to the eventual popularity of regular expressions, previously regarded mostly as a tool (or toy) for logicians.^{[citation needed]} Regular expressions became pervasive in Unix text processing programs (such as grep) and in modern programming languages such as Perl; they are also a central concept in Rob Pike's sam text editor. Almost all programs that work with regular expressions today use some variant of Thompson's notation for them.

Thompson also developed UTF-8 (a widely used character encoding scheme) together with Rob Pike in 1992.^[4]

Along with Joseph Condon, he created the hardware and software for Belle, a world champion chess computer. He also wrote programs for generating the complete enumeration of chess endings, known as endgame tablebases, for all 4, 5, and 6-piece endings, allowing chess-playing computer programs to make "perfect" moves once a position stored in them is reached. Later, with the help of chess endgame expert John Roycroft, Thompson distributed his first results on CD-ROM.

Thompson's style of programming has influenced others, notably in the terseness of his expressions and a preference for clear statements.^{[citation needed]}

In late 2000, Thompson retired from Bell Labs. He worked at Entrisphere, Inc as a fellow until 2006 and now works at Google as a Distinguished Engineer.

Thompson was elected to the National Academy of Engineering in 1980 for "designing UNIX, an operating systems whose efficiency, breadth, power, and style have guided a generation's exploitation of minicomputers."^[5]

Notes[link]

When Seibel (Coders at Work's interview) asked him: "How did you learn to program?" He said that: "I was always fascinated with logic and even in grade school I’d work on arithmetic problems in binary, stuff like that. Just because I was fascinated." ^[6]

Awards[link]

Thompson (left) and Ritchie (center) receiving the National Medal of Technology from President Clinton.

Turing Award[link]

In 1983, Thompson and Ritchie jointly received the Turing Award for their development of generic operating systems theory and specifically for the implementation of the UNIX operating system. His acceptance speech, "Reflections on Trusting Trust"^[7] presented the backdoor attack now known as the Thompson hack or trusting trust attack, and is widely considered a seminal computer security work in its own right.

IEEE Richard W. Hamming Medal[link]

In 1990, both Thompson and Dennis Ritchie received the IEEE Richard W. Hamming Medal from the Institute of Electrical and Electronics Engineers (IEEE), "for the origination of the UNIX operating system and the C programming language".^[8]

Fellow of the Computer History Museum[link]

In 1997, both Thompson and Ritchie were inducted as Fellows of the Computer History Museum for "the co-creation of the UNIX operating system, and for development of the C programming language."

National Medal of Technology[link]

On April 27, 1999, Thompson and Ritchie jointly received the 1998 National Medal of Technology from President Bill Clinton for co-inventing the UNIX operating system and the C programming language which together have led to enormous advances in computer hardware, software, and networking systems and stimulated growth of an entire industry, thereby enhancing American leadership in the Information Age.^[9][10]

Tsutomu Kanai Award[link]

In 1999, the Institute of Electrical and Electronics Engineers chose Thompson to receive the first Tsutomu Kanai Award for his role in creating the UNIX operating system, which for decades has been a key platform for distributed systems work.^[11]

Japan Prize[link]

In 2011 Ken Thompson, along with Dennis Ritchie, was awarded the Japan Prize for Information and Communications for the pioneering work in the development of Unix operating system.^[12]

References[link]

External links[link]

Wikiquote has a collection of quotations related to: Kenneth Thompson

Listen to this article (info/dl)

This audio file was created from a revision of the "Ken Thompson" article dated 2006-06-17, and does not reflect subsequent edits to the article. (Audio help)

More spoken articles

• Ken Thompson Bell Labs page
• Reflections on Trusting Trust 1983 Turing Award Lecture
• Unix and Beyond: An Interview with Ken Thompson IEEE Computer Society
• Ken Thompson: A Brief Introduction The Linux Information Project (LINFO)
• Computer Chess Comes of Age: Photos Computer History Museum
• Computer Chess Comes of Age: Video of Interview with Ken Thompson Computer History Museum
• Reading Chess paper by HS Baird and Ken Thompson on optical character recognition

Dennis MacAlistair Ritchie
Dennis Ritchie, 1999
Born	(1941-09-09)September 9, 1941 Bronxville, New York, U.S.
Died	found dead October 12, 2011(2011-10-12) (aged 70) Berkeley Heights, New Jersey, U.S.
Nationality	American
Fields	Computer science
Institutions	Lucent Technologies Bell Labs
Alma mater	Harvard University
Known for	ALTRAN B BCPL C Multics Unix
Notable awards	Turing Award National Medal of Technology

Dennis MacAlistair Ritchie (b. September 9, 1941; found dead October 12, 2011),^[1][2][3][4] was an American computer scientist who "helped shape the digital era."^[1] He created the C programming language and, with long-time colleague Ken Thompson, the Unix operating system.^[1] Ritchie and Thompson received the Turing Award from the ACM in 1983, the Hamming Medal from the IEEE in 1990 and the National Medal of Technology from President Clinton in 1999. Ritchie was the head of Lucent Technologies System Software Research Department when he retired in 2007. He was the 'R' in K&R C and commonly known by his username dmr.

Biography[link]

Ritchie was born in Bronxville, New York. His father was Alistair E. Ritchie, a longtime Bell Labs scientist and co-author of The Design of Switching Circuits on switching circuit theory. He moved with his family to Summit, New Jersey, as a child, where he graduated from Summit High School.^[5]

Ritchie graduated from Harvard University with degrees in physics and applied mathematics. In 1967, he began working at the Bell Labs Computing Sciences Research Center, and in 1968, he received a PhD from Harvard under the supervision of Patrick C. Fischer, his doctoral dissertation being "Program Structure and Computational Complexity".^[6]

Ritchie was best known as the creator of the C programming language, a key developer of the Unix operating system, and co-author of the book The C Programming Language, and was the 'R' in K&R (a common reference to the book's authors Kernighan and Ritchie). Ritchie worked together with Ken Thompson, the scientist credited with writing the original Unix; one of Ritchie's most important contributions to Unix was its porting to different machines and platforms.^[7]

The C language is widely used today in application, operating system, and embedded system development, and its influence is seen in most modern programming languages. Unix has also been influential, establishing concepts and principles that are now precepts of computing.

Awards[link]

Ken Thompson [L] and Dennis Ritchie [R]

In 1983, Ritchie and Thompson received the Turing Award for their development of generic operating systems theory and specifically for the implementation of the UNIX operating system. Ritchie's Turing Award lecture was titled "Reflections on Software Research".^[8] In 1990, both Ritchie and Thompson received the IEEE Richard W. Hamming Medal from the Institute of Electrical and Electronics Engineers (IEEE), "for the origination of the UNIX operating system and the C programming language".^[9]

In 1997, both Ritchie and Thompson were made Fellows of the Computer History Museum, "for co-creation of the UNIX operating system, and for development of the C programming language."

Thompson (left) and Ritchie (center) receiving the National Medal of Technology from President Clinton in 1999

On April 21, 1999, Thompson and Ritchie jointly received the National Medal of Technology of 1998 from President Bill Clinton for co-inventing the UNIX operating system and the C programming language which, according to the citation for the medal, "led to enormous advances in computer hardware, software, and networking systems and stimulated growth of an entire industry, thereby enhancing American leadership in the Information Age".^[10][11]

In 2005, the Industrial Research Institute awarded Ritchie with its Achievement Award in recognition of his contribution to science and technology, and to society generally, with his development of the Unix operating system.^[12]

In 2011, Ritchie, along with Thompson, was awarded the Japan Prize for Information and Communications for his work in the development of the Unix operating system.^[13]

Death and legacy[link]

Ritchie was found dead on October 12, 2011, at the age of 70 at his home in Berkeley Heights, New Jersey, where he lived alone.^[1] First news of his death came from his former colleague, Rob Pike.^[2][3] The cause and exact time of death have not been disclosed.^[14] He had been in frail health for several years following treatment for prostate cancer and heart disease.^{[1][2][15][16]} His death came a week after Steve Jobs', but did not receive as much media coverage.^[17][18] Computer historian Paul E. Ceruzzi said after his death: "Ritchie was under the radar. His name was not a household name at all, but... if you had a microscope and could look in a computer, you'd see his work everywhere inside."^[19]

In an interview shortly after Ritchie's death long time colleague Brian Kernighan said Ritchie never expected C to be so significant.^[20] Kernighan reminded readers of how important a role C and UNIX had played in the development of later high-profile projects, like the iPhone.^[21][22]

Other testimonials to his influence followed.^{[23][24][25][26]}

The Fedora 16 Linux distribution, which was released about a month after he died, was dedicated to his memory.^[27] FreeBSD 9.0, released January 12, 2012 was also dedicated in his memory.^[28]

Notable books[link]

• Unix Programmer's Manual (1971)
• The C Programming Language (1978 with Brian Kernighan; see K&R)

References[link]

External links[link]

Wikimedia Commons has media related to: Dennis Ritchie

Wikiquote has a collection of quotations related to: Dennis Ritchie

Listen to this article (info/dl)

This audio file was created from a revision of the "Dennis Ritchie" article dated June 17, 2006, and does not reflect subsequent edits to the article. (Audio help)

More spoken articles

• Dennis Ritchie's home page at Bell Labs
• "The C Family of Languages: Interview with Dennis Ritchie, Bjarne Stroustrup, and James Gosling" – article in Java Report, 5(7), July 2000 and C++ Report, 12(7), July/August 2000
• "The Guru" – article in Linux Magazine, June 2001
• Dennis Ritchie's video interview June 2011
• Works by or about Dennis Ritchie in libraries (WorldCat catalog)
• Dennis Ritchie at Find a Grave
• Dennis Ritchie at the Open Directory Project