- 166
- 268 871
Turing Awardee Clips
United States
Приєднався 9 лип 2014
The ACM A.M. Turing Award, often referred to as the “Nobel Prize of Computing,” carries a $1 million prize, with financial support provided by Google, Inc. It is named for Alan M. Turing, the British mathematician who articulated the mathematical foundation and limits of computing. Since its inception in 1966, the Turing Award has honored the computer scientists and engineers who created the systems and underlying theoretical foundations that have propelled the information technology industry.
The video clips presented here were edited down from longer interviews with award recipients conducted by ACM (or provided to ACM by other organizations) to accompany the biographical profiles at amturing.acm.org/. Each clip describes a key contribution of an awardee or an important moment in their life or career. Clip descriptions includes a links to corresponding biographical profiles, where you can learn the context for the events they describe and access the full interviews.
The video clips presented here were edited down from longer interviews with award recipients conducted by ACM (or provided to ACM by other organizations) to accompany the biographical profiles at amturing.acm.org/. Each clip describes a key contribution of an awardee or an important moment in their life or career. Clip descriptions includes a links to corresponding biographical profiles, where you can learn the context for the events they describe and access the full interviews.
Pearl on the tradeoff between quality of search and quality of perception.
Judea Pearl, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the fundamental tradeoff in search between exploring more positions and evaluating each position more thoroughly. This clip is taken from an interview conducted with Pearl by David Brock for ACM and the Computer History Museum on July 6, 2022. Video of the full interview is available as part of Pearl’s ACM profile at amturing.acm.org/award_winners/pearl_2658896.cfm.
Переглядів: 188
Відео
Pearl: "I apologize for being so stupid" by treating causality as a probabalistic relationship.
Переглядів 2097 місяців тому
Judea Pearl, winner of the Association for Computing Machinery's A.M. Turing Award, explains that his focus in recent decades on causality led him to completely rethink his earlier assumption that causality was just shorthand for a particular kind of probabilistic relationship. This clip is taken from an interview conducted by David Brock for ACM and the Computer History Museum on July 6, 2022....
Pearl: "a system that works in a crazy way" - defining the Bayesian belief network.
Переглядів 2477 місяців тому
Judea Pearl, winner of the Association for Computing Machinery's A.M. Turing Award, explains how he invented belief networks and the propagation method around the concept of conditional independence. This clip is taken from an interview conducted with Pearl by David Brock for ACM and the Computer History Museum on July 6, 2022. Video of the full interview is available as part of Pearl’s ACM pro...
Scott on inventing the Logic of Computable Functions to win an argument with Christopher Strachey.
Переглядів 2027 місяців тому
Dana S. Scott, winner of the Association for Computing Machinery's A.M. Turing Award, tells how he came up with the Logic of Computable Functions during a sabbatical in Oxford, while trying to convince Christopher Strachey that using type-free lambda calculus for modelling was a mistake. This clip is taken from an interview conducted by Gordon Plotkin for the ACM between November 12, 2020 and F...
Scott on the origins of computer science at Stanford and teaching Barbara Liskov.
Переглядів 547 місяців тому
Dana S. Scott, winner of the Association for Computing Machinery's A.M. Turing Award, shares his impressions of the early days of computer science at Stanford including the contributions of George Forsythe, Donald Knuth, and John McCarthy. He also recalls teaching Barbara Liskov. This clip is taken from an interview conducted by Gordon Plotkin for the ACM between November 12, 2020 and February ...
Scott explains the thesis he wrote for Alonzo Church on proof in infinite dimensional geometries.
Переглядів 1857 місяців тому
Dana S. Scott, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the Ph.D. thesis he wrote at Princeton under the supervision of Alonzo Church. It concerned the validity of proofs across geometries with different dimensions, establishing that "there is only one infinite-dimensional theory." This clip is taken from an interview conducted by Gordon Plotkin for the A...
Scott tells how he discovered nondeterministic automata with Michael Rabin in a classic paper.
Переглядів 1217 місяців тому
Dana S. Scott, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the work he did with Michael Rabin during an internship at IBM Research when they were both graduate students. Their summer project of 1957 led to a classic paper, in which the class of nondeterministic automata was defined for the first time. This clip is taken from an interview conducted by Gordon ...
Aho explains how Lex and YACC revolutionized compiler creation by uniting theory and practice
Переглядів 3217 місяців тому
Alfred Vaino Aho, winner of the Association for Computing Machinery's A.M. Turing Award, discusses his work at Bell Labs with Jeff Ullman and Steve Johnson to create the parser generator YACC and lexical analyzer generator Lex. These tools revolutionized the creation of compilers, allowing his undergraduate students to design a language and implement a compiler for it as their term project. Thi...
Aho on inventing indexed grammars and the nested stack automaton for his Ph.D. thesis.
Переглядів 1217 місяців тому
Alfred Vaino Aho, winner of the Association for Computing Machinery's A.M. Turing Award, explains how in invented indexed grammars and the nested stack automaton to recognize them while working on his Ph.D. thesis at Princeton under the direction of John Hopcroft. This clip is taken from an interview conducted with Aho by Hansen Hsu for the ACM and Computer History Museum on June 13, 2022. Vide...
Aho: "I'm the A in AWK."
Переглядів 5187 місяців тому
Alfred Vaino Aho, winner of the Association for Computing Machinery's A.M. Turing Award, discusses his work at Bell Labs with Brian Kernighan and Peter Weinberger to create AWK, a language used to write "throwaway one or two line programs" to perform data processing tasks. AWK became a standard part of the Unix toolkit. This clip is taken from an interview conducted with Aho by Hansen Hsu for t...
Aho: Seeing the Dragon Book in Hackers convinced his children that he was "really something."
Переглядів 2777 місяців тому
Alfred Vaino Aho, winner of the Association for Computing Machinery's A.M. Turing Award, discusses how he wrote the "Dragon Book" (Compilers: Principles, Techniques, and Tools) with Jeffrey Ullman and why an Angelia Jolie movie convinced his kids that "their only man was really something." This clip is taken from an interview conducted with Aho by Hansen Hsu for the ACM and Computer History Mus...
Aho on the "great crime" of confusing algorithms and procedures.
Переглядів 3437 місяців тому
Alfred Vaino Aho, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the approach he and Jeffrey Ullman took when writing their book The Design and Analysis of Computer Algorithms to distinguish between algorithms and procedures. This clip is taken from an interview conducted with Aho by Hansen Hsu for the ACM and Computer History Museum on June 13, 2022. Video of ...
Wirth on the importance of abstraction to language design
Переглядів 4,1 тис.4 роки тому
Niklaus Wirth, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the importance of abstraction to language design. This clip is taken from an interview conducted with Wirth by Elena Trichina for the ACM on 13 March, 2018 in Zürich, Switzerland. Video of the full interview is available as part of Wirth’s ACM profile at amturing.acm.org/award_winners/wirth_1025774.cfm.
Wirth on Lillith and Modula
Переглядів 2,7 тис.4 роки тому
Niklaus Wirth, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the roots of Lilith and Modula in his time at Xerox PARC. This clip is taken from an interview conducted with Wirth by Elena Trichina for the ACM on 13 March, 2018 in Zürich, Switzerland. Video of the full interview is available as part of Wirth’s ACM profile at amturing.acm.org/award_winners/wirth_1...
Wirth on the implementation and spread of Pascal
Переглядів 3,1 тис.4 роки тому
Niklaus Wirth, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the implementation and spread of Pascal, focusing on its use of a virtual machine to improve efficiency and portability. This clip is taken from an interview conducted with Wirth by Elena Trichina for the ACM on 13 March, 2018 in Zürich, Switzerland. Video of the full interview is available as part o...
Kahan on creating IEEE Standard Floating Point
Переглядів 3,6 тис.4 роки тому
Kahan on creating IEEE Standard Floating Point
Kahan on HP calculators: Solve, Integrate and Matrix Operations
Переглядів 14 тис.4 роки тому
Kahan on HP calculators: Solve, Integrate and Matrix Operations
Kahan on the 8087 and designing Intel's floating point
Переглядів 4,8 тис.4 роки тому
Kahan on the 8087 and designing Intel's floating point
Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson
Переглядів 6224 роки тому
Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson
Kahan on the FERUT, the first computer he programmed
Переглядів 7674 роки тому
Kahan on the FERUT, the first computer he programmed
Feigenbaum on IntelliCorp and Teknowledge
Переглядів 1914 роки тому
Feigenbaum on IntelliCorp and Teknowledge
Feigenbaum on editing Computers and Thought
Переглядів 1614 роки тому
Feigenbaum on editing Computers and Thought
Feigenbaum on the Heuristic Programming Project and DENRAL
Переглядів 6574 роки тому
Feigenbaum on the Heuristic Programming Project and DENRAL
Feigenbaum on EAPM, his Ph.D. project with Herb Simon
Переглядів 1684 роки тому
Feigenbaum on EAPM, his Ph.D. project with Herb Simon
Feigenbaum on working with Herb Simon and John Backus
Переглядів 2234 роки тому
Feigenbaum on working with Herb Simon and John Backus
Feigenbaum on his family background and love of science
Переглядів 2184 роки тому
Feigenbaum on his family background and love of science
Goldwasser defines a Probabilistically Checkable Proof
Переглядів 9074 роки тому
Goldwasser defines a Probabilistically Checkable Proof
Goldwasser on Kilian, Schoof and primality
Переглядів 4164 роки тому
Goldwasser on Kilian, Schoof and primality
Goldwasser defines zero knowledge proofs
Переглядів 8 тис.4 роки тому
Goldwasser defines zero knowledge proofs