Turing Awardee Clips
Videos from Turing Awardee Clips
Page 1 of 1 • 8 total videos
5:44
Dana S. Scott Discusses the Creation of the Logic of Computable Functions
Turing Awardee Clips
345 views
8:32
Stearns on writing "On the Computational Complexity of Algorithms”
Turing Awardee Clips
214 views
5:43
Rabin on writing “Finite Automata and their Decision Problems” with Dana Scott
Turing Awardee Clips
710 views
4:56
Micali on the impact of "Probabilistic Encryption" (1984)
Turing Awardee Clips
330 views
1:58
Hopcroft on Formal Languages and Their Relationship to Automata.
Turing Awardee Clips
733 views
1:04
Cook explains why P=NP matters.
Turing Awardee Clips
4.7K views
3:52
Corbato on Multics
Turing Awardee Clips
1.2K views
4:38
Corbato on choosing GE for Multics development
Turing Awardee Clips
240 views