Канал: Turing Awardee Clips

Pearl on the tradeoff between quality of search and quality of perception.

Pearl on the tradeoff between quality of search and quality of perception.

Pearl: "I apologize for being so stupid" by treating causality as a probabalistic relationship.

Pearl: "I apologize for being so stupid" by treating causality as a probabalistic relationship.

Pearl: "a system that works in a crazy way" - defining the Bayesian belief network.

Pearl: "a system that works in a crazy way" - defining the Bayesian belief network.

Scott on inventing the Logic of Computable Functions to win an argument with Christopher Strachey.

Scott on inventing the Logic of Computable Functions to win an argument with Christopher Strachey.

Scott on the origins of computer science at Stanford and teaching Barbara Liskov.

Scott on the origins of computer science at Stanford and teaching Barbara Liskov.

Scott explains the thesis he wrote for Alonzo Church on proof in infinite dimensional geometries.

Scott explains the thesis he wrote for Alonzo Church on proof in infinite dimensional geometries.

Scott tells how he discovered nondeterministic automata with Michael Rabin in a classic paper.

Scott tells how he discovered nondeterministic automata with Michael Rabin in a classic paper.

Aho explains how Lex and YACC revolutionized compiler creation by uniting theory and practice

Aho explains how Lex and YACC revolutionized compiler creation by uniting theory and practice

Aho on inventing indexed grammars and the nested stack automaton for his Ph.D. thesis.

Aho on inventing indexed grammars and the nested stack automaton for his Ph.D. thesis.

Aho: "I'm the A in AWK."

Aho: "I'm the A in AWK."

Aho: Seeing the Dragon Book in Hackers convinced his children that he was "really something."

Aho: Seeing the Dragon Book in Hackers convinced his children that he was "really something."

Aho on the "great crime" of confusing algorithms and procedures.

Aho on the "great crime" of confusing algorithms and procedures.

Wirth on the importance of abstraction to language design

Wirth on the importance of abstraction to language design

Wirth on Lillith and Modula

Wirth on Lillith and Modula

Wirth on the implementation and spread of Pascal

Wirth on the implementation and spread of Pascal

Wirth on his first Algol compiler

Wirth on his first Algol compiler

Kahan on creating IEEE Standard Floating Point

Kahan on creating IEEE Standard Floating Point

Kahan on HP calculators: Solve, Integrate and Matrix Operations

Kahan on HP calculators: Solve, Integrate and Matrix Operations

Kahan on the 8087 and designing Intel's floating point

Kahan on the 8087 and designing Intel's floating point

Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson

Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson

Kahan on the FERUT, the first computer he programmed

Kahan on the FERUT, the first computer he programmed

Feigenbaum on IntelliCorp and Teknowledge

Feigenbaum on IntelliCorp and Teknowledge

Feigenbaum on editing Computers and Thought

Feigenbaum on editing Computers and Thought

Feigenbaum on the Heuristic Programming Project and DENRAL

Feigenbaum on the Heuristic Programming Project and DENRAL

Feigenbaum on EAPM, his Ph.D. project with Herb Simon

Feigenbaum on EAPM, his Ph.D. project with Herb Simon

Feigenbaum on working with Herb Simon and John Backus

Feigenbaum on working with Herb Simon and John Backus

Feigenbaum on his family background and love of science

Feigenbaum on his family background and love of science

Goldwasser defines a Probabilistically Checkable Proof

Goldwasser defines a Probabilistically Checkable Proof

Goldwasser on Kilian, Schoof and primality

Goldwasser on Kilian, Schoof and primality

Goldwasser defines zero knowledge proofs

Goldwasser defines zero knowledge proofs

Goldwasser on hiding partial information in "mental poker"

Goldwasser on hiding partial information in "mental poker"

Goldwasser on being introduced to cryptography by Manuel Blum

Goldwasser on being introduced to cryptography by Manuel Blum

Goldwasser on graduate school at Berkeley and Manuel Blum

Goldwasser on graduate school at Berkeley and Manuel Blum

Lamport on the origins of Paxos

Lamport on the origins of Paxos

Lamport on Temporal Logic of Actions and refinement mapping

Lamport on Temporal Logic of Actions and refinement mapping

Lamport on Byzantine Generals and Byzantine Failures

Lamport on Byzantine Generals and Byzantine Failures

Lamport on writing "Time, Clocks, and the Ordering of Events in a Distributed System"

Lamport on writing "Time, Clocks, and the Ordering of Events in a Distributed System"

Lamport defines safe, regular, and atomic registers

Lamport defines safe, regular, and atomic registers

Lamport on discovering the Bakery Algorithm

Lamport on discovering the Bakery Algorithm

Kahn on writing "A Protocol for Packet Radio Interconnection" (1974)

Kahn on writing "A Protocol for Packet Radio Interconnection" (1974)

Kahn and Cerf on why the ARPANET was built

Kahn and Cerf on why the ARPANET was built

Kahn on writing the ARPANET proposal

Kahn on writing the ARPANET proposal

Kahn on inventing ARPANET gateways

Kahn on inventing ARPANET gateways

Sifakis explains his shift to embedded systems work.

Sifakis explains his shift to embedded systems work.

Sifakis on Verimag and "correctness by construction."

Sifakis on Verimag and "correctness by construction."

Sifakis defines model checking

Sifakis defines model checking

Sifakis on his first model checking work

Sifakis on his first model checking work

Hoare on communicating sequential processes

Hoare on communicating sequential processes

Hoare on inventing Quicksort

Hoare on inventing Quicksort

Hoare on the definition and purpose of the Hoare Triple

Hoare on the definition and purpose of the Hoare Triple

Hoare's early life and undergraduate education

Hoare's early life and undergraduate education

Stearns on his work with Harry Hunt III

Stearns on his work with Harry Hunt III

Stearns on his space complexity work with Lewis

Stearns on his space complexity work with Lewis

Stearns on writing "On the Computational Complexity of Algorithms”

Stearns on writing "On the Computational Complexity of Algorithms”

Stearns on his first exposure to computers and computer science

Stearns on his first exposure to computers and computer science

Knuth on taking fonts seriously

Knuth on taking fonts seriously

Knuth on designing and implementing TeX

Knuth on designing and implementing TeX

Knuth on the origins of TeX

Knuth on the origins of TeX

Knuth on choosing Stanford and computer science

Knuth on choosing Stanford and computer science

Knuth: I told my wife "I think I'm going to write a book" - starting The Art of Computer Programming

Knuth: I told my wife "I think I'm going to write a book" - starting The Art of Computer Programming

Knuth on not writing compilers for a living

Knuth on not writing compilers for a living

Knuth: "The story of my life is making errors and trying to recover from them."

Knuth: "The story of my life is making errors and trying to recover from them."

Knuth on Literate Programming

Knuth on Literate Programming

Blum on creating CAPTCHA

Blum on creating CAPTCHA

Blum on automated program checkers with Ronitt Rubinfeld

Blum on automated program checkers with Ronitt Rubinfeld

Blum on zero knowledge proofs

Blum on zero knowledge proofs

Blum on his "speedup theorem"

Blum on his "speedup theorem"

Blum on median finding in linear time

Blum on median finding in linear time

Tarjan on creating a linear expected time minimum spanning tree algorithm with Karger and Klein

Tarjan on creating a linear expected time minimum spanning tree algorithm with Karger and Klein

Tarjan on developing of the splay tree with Danny Sleator

Tarjan on developing of the splay tree with Danny Sleator

Tarjan on analyzing the "union-find" data structure

Tarjan on analyzing the "union-find" data structure

Tarjan on his graduate school collaboration with Hopcroft

Tarjan on his graduate school collaboration with Hopcroft

Rabin on writing “Finite Automata and their Decision Problems” with Dana Scott

Rabin on writing “Finite Automata and their Decision Problems” with Dana Scott

Rabin on studying at Penn and Princeton (under Alonzo Church)

Rabin on studying at Penn and Princeton (under Alonzo Church)

Rabin on guards, passwords, and the time difficulty of computation.

Rabin on guards, passwords, and the time difficulty of computation.

Rabin on probabilistic automata and primality testing

Rabin on probabilistic automata and primality testing

Rabin on becoming a mathematician at Hebrew University

Rabin on becoming a mathematician at Hebrew University

Reddy on founding the CMU Robotics Institute

Reddy on founding the CMU Robotics Institute

Reddy on early CMU speech recognition systems

Reddy on early CMU speech recognition systems

Reddy on Graduate School with John McCarthy

Reddy on Graduate School with John McCarthy

Reddy: "“My God, this looks ugly" - juicy steaks and the DEUCE

Reddy: "“My God, this looks ugly" - juicy steaks and the DEUCE

Bachman on the IDS Problem Controller

Bachman on the IDS Problem Controller

Bachman on the Integrated Data Store (IDS) - the first DBMS

Bachman on the Integrated Data Store (IDS) - the first DBMS

Bachman on the development of the OSI 7 layer model for network communications.

Bachman on the development of the OSI 7 layer model for network communications.

Bachman on MIACS.

Bachman on MIACS.

Brooks on the System 360 and adoption of the 8 bit byte

Brooks on the System 360 and adoption of the 8 bit byte

Brooks on Stretch and Harvest

Brooks on Stretch and Harvest

Brooks on writing The Mythical Man Month

Brooks on writing The Mythical Man Month

Brooks on Aiken and Iverson

Brooks on Aiken and Iverson

Newell on Soar as a "final project" that would outlast him.

Newell on Soar as a "final project" that would outlast him.

Newell on first recognizing the computer as a model of mind.

Newell on first recognizing the computer as a model of mind.

Newell sums up the question that drove his career.

Newell sums up the question that drove his career.

Newell on list processing.

Newell on list processing.

Hellman on the publication of "New Directions in Cryptography".

Hellman on the publication of "New Directions in Cryptography".

Hellman critiques the DES standard for encryption.

Hellman critiques the DES standard for encryption.

Hellman on his Ph.D. ("Learning with Finite Memory")

Hellman on his Ph.D. ("Learning with Finite Memory")

Hellman on the definition of public key encryption.

Hellman on the definition of public key encryption.

Karp on his shift to computational biology.

Karp on his shift to computational biology.

Karp on the probabilistic analysis of algorithmic complexity.

Karp on the probabilistic analysis of algorithmic complexity.

Karp on formulating the P = NP question.

Karp on formulating the P = NP question.

Karp on the definition of P and NP.

Karp on the definition of P and NP.

Karp on working at IBM Research

Karp on working at IBM Research

Micali on barely making it through U.C. Berkeley.

Micali on barely making it through U.C. Berkeley.

Micali on how a Sicilian childhood made him a cryptographer.

Micali on how a Sicilian childhood made him a cryptographer.

Micali on interactive and zero knowledge proofs.

Micali on interactive and zero knowledge proofs.

Micali on the impact of "Probabilistic Encryption" (1984)

Micali on the impact of "Probabilistic Encryption" (1984)

Micali on writing "Probabilistic Encryption" (1984) with Goldwasser

Micali on writing "Probabilistic Encryption" (1984) with Goldwasser

Rivest on the creation of Introduction to Algorithms.

Rivest on the creation of Introduction to Algorithms.

Rivest on the commercial development of RSA.

Rivest on the commercial development of RSA.

Rivest on the origins of RSA.

Rivest on the origins of RSA.

Rivest on the Stanford computer science department in the 1970s.

Rivest on the Stanford computer science department in the 1970s.

Hartmanis on nondeterminism and its relationship to P=NP.

Hartmanis on nondeterminism and its relationship to P=NP.

Hartmanis on the invention of complexity classes

Hartmanis on the invention of complexity classes

Hartmanis on the origin of his collaboration with Dick Stearns.

Hartmanis on the origin of his collaboration with Dick Stearns.

Hartmanis on Soviet occupation and death of his father.

Hartmanis on Soviet occupation and death of his father.

Emerson on the adoption of model checking and the state explosion problem.

Emerson on the adoption of model checking and the state explosion problem.

Emerson on the introduction of model checking for hardware and software verification.

Emerson on the introduction of model checking for hardware and software verification.

Emerson on developing an interest in program verification

Emerson on developing an interest in program verification

Emerson on choosing computer science over mathematics.

Emerson on choosing computer science over mathematics.

Hopcroft on collaborating with Tarjan to study graph algorithms.

Hopcroft on collaborating with Tarjan to study graph algorithms.

Hopcroft on Formal Languages and Their Relationship to Automata.

Hopcroft on Formal Languages and Their Relationship to Automata.

Hopcroft on being hired at Princeton.

Hopcroft on being hired at Princeton.

Hopcroft on his first computer experience.

Hopcroft on his first computer experience.

Valiant on the Bulk Synchronous Model

Valiant on the Bulk Synchronous Model

Valiant on the discovery of P#-completeness

Valiant on the discovery of P#-completeness

Valiant on his 1983 paper "A Theory of the Learnable"

Valiant on his 1983 paper "A Theory of the Learnable"

Valiant on the centrality of learning to AI.

Valiant on the centrality of learning to AI.

Cook thinks that P does not equal NP.

Cook thinks that P does not equal NP.

Cook explains why P=NP matters.

Cook explains why P=NP matters.

Cook on “The Complexity of Theorem-Proving Procedures“

Cook on “The Complexity of Theorem-Proving Procedures“

Cook on his thesis work and introduction to complexity theory.

Cook on his thesis work and introduction to complexity theory.

Pearl on the importance of rebellion to science.

Pearl on the importance of rebellion to science.

Pearl on the illusion of free will.

Pearl on the illusion of free will.

Pearl on his inspirational teachers.

Pearl on his inspirational teachers.

Allen on developing parallel compilers for IBM.

Allen on developing parallel compilers for IBM.

Allen on developing compilers for STRETCH.

Allen on developing compilers for STRETCH.

Allen describes IBM's Stretch computer.

Allen describes IBM's Stretch computer.

Allen on joining IBM and teaching FORTRAN.

Allen on joining IBM and teaching FORTRAN.

Corbato on Multics

Corbato on Multics

Corbato on choosing GE for Multics development

Corbato on choosing GE for Multics development

Corbato on the beginning of timesharing with CTSS.

Corbato on the beginning of timesharing with CTSS.

Corbato describes MIT's Whirlwind computer.

Corbato describes MIT's Whirlwind computer.

Gray on database benchmarks and stunts to promote them.

Gray on database benchmarks and stunts to promote them.

Gray on database transactions and the ACID test.

Gray on database transactions and the ACID test.

Gray on the relational database model

Gray on the relational database model

Gray on the Club of Rome model

Gray on the Club of Rome model

Backus on functional programming.

Backus on functional programming.

Backus on the genesis of BNF.

Backus on the genesis of BNF.

Backus describes the creation of FORTRAN,

Backus describes the creation of FORTRAN,

Backus describes the IBM SSEC.

Backus describes the IBM SSEC.

Adleman: Taking On Fermat's Last Theorem

Adleman: Taking On Fermat's Last Theorem

Adleman: The first computer virus?

Adleman: The first computer virus?

Adleman: Creating the RSA Cryptosystem

Adleman: Creating the RSA Cryptosystem

Adleman: Inventing DNA Computing

Adleman: Inventing DNA Computing

Diffie: Writing "New Directions in Cryptography" (1976)

Diffie: Writing "New Directions in Cryptography" (1976)

Stonebraker: Shifting to Databases

Stonebraker: Shifting to Databases

Diffie: Explains Public Key Encyption.

Diffie: Explains Public Key Encyption.

Diffie: Countercultural Attraction to Encryption

Diffie: Countercultural Attraction to Encryption

Diffie: Reading Kahn & Beginning to Roam

Diffie: Reading Kahn & Beginning to Roam

Stonebraker: Building INGRES

Stonebraker: Building INGRES

Stonebraker: Goals for Postgres

Stonebraker: Goals for Postgres

Stonebraker: Commercializing INGRES

Stonebraker: Commercializing INGRES

Liskov: Algol, Venus & variable scope

Liskov: Algol, Venus & variable scope

Liskov: Inventing Data Abstraction

Liskov: Inventing Data Abstraction

Liskov: The CLU Programming Language

Liskov: The CLU Programming Language

Liskov: The Liskov Substitution Principle

Liskov: The Liskov Substitution Principle