- 166
- 229 920
Turing Awardee Clips
United States
Registrace 9. 07. 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.
zhlédnutí: 37
Video
Pearl: "I apologize for being so stupid" by treating causality as a probabalistic relationship.
zhlédnutí 55Před 12 hodinami
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.
zhlédnutí 25Před 12 hodinami
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.
zhlédnutí 15Před 12 hodinami
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.
zhlédnutí 16Před 12 hodinami
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.
zhlédnutí 30Před 12 hodinami
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.
zhlédnutí 19Před 12 hodinami
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
zhlédnutí 80Před 12 hodinami
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.
zhlédnutí 23Před 12 hodinami
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."
zhlédnutí 93Před 12 hodinami
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."
zhlédnutí 46Před 12 hodinami
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.
zhlédnutí 192Před 12 hodinami
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
zhlédnutí 3,5KPřed 3 lety
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
zhlédnutí 2,3KPřed 3 lety
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
zhlédnutí 2,8KPřed 3 lety
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
zhlédnutí 3KPřed 3 lety
Kahan on creating IEEE Standard Floating Point
Kahan on HP calculators: Solve, Integrate and Matrix Operations
zhlédnutí 12KPřed 3 lety
Kahan on HP calculators: Solve, Integrate and Matrix Operations
Kahan on the 8087 and designing Intel's floating point
zhlédnutí 3,7KPřed 3 lety
Kahan on the 8087 and designing Intel's floating point
Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson
zhlédnutí 515Před 3 lety
Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson
Kahan on the FERUT, the first computer he programmed
zhlédnutí 688Před 3 lety
Kahan on the FERUT, the first computer he programmed
Feigenbaum on IntelliCorp and Teknowledge
zhlédnutí 164Před 3 lety
Feigenbaum on IntelliCorp and Teknowledge
Feigenbaum on editing Computers and Thought
zhlédnutí 146Před 3 lety
Feigenbaum on editing Computers and Thought
Feigenbaum on the Heuristic Programming Project and DENRAL
zhlédnutí 554Před 3 lety
Feigenbaum on the Heuristic Programming Project and DENRAL
Feigenbaum on EAPM, his Ph.D. project with Herb Simon
zhlédnutí 161Před 3 lety
Feigenbaum on EAPM, his Ph.D. project with Herb Simon
Feigenbaum on working with Herb Simon and John Backus
zhlédnutí 210Před 3 lety
Feigenbaum on working with Herb Simon and John Backus
Feigenbaum on his family background and love of science
zhlédnutí 192Před 3 lety
Feigenbaum on his family background and love of science
Goldwasser defines a Probabilistically Checkable Proof
zhlédnutí 761Před 3 lety
Goldwasser defines a Probabilistically Checkable Proof
Goldwasser on Kilian, Schoof and primality
zhlédnutí 383Před 3 lety
Goldwasser on Kilian, Schoof and primality
Goldwasser defines zero knowledge proofs
zhlédnutí 6KPřed 3 lety
Goldwasser defines zero knowledge proofs
I took numerical linear algebra in college and his work is foundational.
But we can use zero knowldge to have a decision of the correctness of a proof, a correct proof is a proof that we can use her same parameters to have an other decision for similar problems. we assume that the axiom system are correct.
Is tricky, we can't proof axioms. So All proofs are zero knowldge.
You are making no sense!
You don't understand. Or just for the community image.
You can search. What Axioms means and If we can proof them. If you want to learn.
A hero. ❤
This guy (asymmetrical eyebrows) is more realistic person in "AI". 🤭
Cool. 😊
"Security is the science of minimizing Trust." Bingo.
The killer Lilith was a cool computer. Pretty simple and clean.
Recalling the days I walked into my University bookshop and excitedly handed over my money to pick up a HP 33c then a couple of years later to pick up a HP 15c, were some of the most etched memories in my life!
Nul. C'est du podcast, pas de la vidéo
Pure astonishment.
R.I.P my HERO 😢
The 41-CV was what the rich kids flourished when I started university - only two in my year had them. Over 40 years later, still nothing can touch those HP calculators: I use my 48GX every day, and run Droid48 on my phone and Emu48 on all my computers.
Mr. Kahan also worked on the FPU ? Wow ! I love his Kahan summation algorithm and its many variants so much.
These interviews are priceless pieces of history. Thank you for preserving them for future generations.
3:04 You see books from the 1970s ... almost everything looked atrocious in those days. - so true!
Finally! I understand. Thank you for sharing this video!
Wow so this is God ? First time I see him.
This gives me goosebumps! One of the greatest discoeries with very large scale adoption. One had decency to value the other collegue so he added him. The other one had the decency to question it. 🥲
Mr. Postgres! We use your product extensively at work.
Wow.
C/C++ really is something that should be left behind - regardless of whether modern languages are marketed more or liked more. The reason is that they are still stuck in the 1970s - they don't abstract more than a Macro Assembler would. C/C++ language are low-level languages, very close to the hardware. The problem is, they are used for low-level things, but also for things that we abstracted from in the 1970s. Largely, the American software industry is to blame for this grandfather regression and the corporate pushes for languages that are never finished, playing some silly game of dominance, rather than trying to make a great language. In the rest of the world, a software engineer has a greater chance of picking the right tool for the job, and leave a codebase that doesn't fail, crash, or won't even compile a few months later without incessant, frail, updates.
RIP hero. <3 Great story on the need for very small implementations. During the 1970s timeshares and later microcomputers changed the needs of computer languages. They had to fit in only 4 or 8K RAM, and before 1975 even BASIC was split into two parts, a translator bytecode that would then free the memory used by the translator and available to the BASIC program. It's nice to know, and sort of expected, that Pascal was there to compete. I've had a life-long love for the Pascal language family, which started with Turbo Pascal and Compis Pascal (Compis was a national college computer in Sweden). I've since had two consecutive careers writing serious applications in Delphi (industry and backend data processing), and now enjoy FreePascal from time to time. I betcha my old applications are still running, and haven't crashed once. That's a testament to the design of these languages.
This guy will ruin my CS studies
I wonder wether Don's wife calls the book "TAOCP".
Beautiful idea, Maam.. This principle is very important to understand
RIP Sir
Rutishauser kannte ich Mitte der 60er Jahren weitaus besser als Nklaus W. : Nun ist NW von uns gegangen - in Pascal und Modula schrieb ich MathLogic Quine, BuralliForte sowie Hao Wang Programme . Antworten
Rest in peace, Niklaus.
Remove that ass fucking captcha
One of those videos where I can't believe this has just 312 views and no comments...! Super interesting.
This is THE explanation from the CREATOR, so sad other videos on this subject have more views
My first available computer Monitor was the size of a seventies fridge
It's really useful but I doubt a single soul likes to use hoare logic to verify code.
Great to see a legitimate women pioneer. Who many girls could see for inspiration as sadly many don't have role models to look up to in comp sci/tech.
Nice.
You have no idea how much I hate you sir 😡
Got my first HP calculator in 1975, an HP25 (Second year electrical engineering) and still use it today, although modified the battery to NiMH. Then got an HP15C and a HP19B financial calculator, still all working. Great machines.
What a wonderful story. CPA with a math degree here. Thanks for the complex numbers and matrices. I've got a few HPs. The 48G is my daily driver; it still has great buttons. My phone has Free42 on it (I'll probably get a Swiss Micros unit with buttons at some point). Every year I program up the latest payroll source deductions formulae on my calculators.
I bought an HP-34C in September 1979 at the start of my senior year of college, specifically because of the SOLVE and INTEGRATE functions…and because I couldn't afford the HP-41C, which released at the same time. I found both functions to be very helpful in finishing my civil engineering degree. I remember solving an iteration problem on a final exam that semester by recording a program in the HP-34C, writing the re-arranged equation and program steps on my test paper along with my initial guesses and a brief explanation of the SOLVE function, then reporting the result. By hand, this problem would have taken perhaps 20 minutes, but my method took only about 2 minutes. My professor loved my approach, and because he used an HP-45 he understood my program. I also appreciated the extra chapter in the manual. As a not-yet-professional, I needed the extra guidance. THANK YOU, Professor Kahan.
Here i am trying to find a simpler explanation of lowest common ancestor and this guy pops up
Still have and use a 15C. What a great calculator!
Man got an IQ of 200.
cool to hear real meaning of the principle from first hands. thanks
Matrix merovingian
good video
I like the concept of these books, and appreciate the massive effort, but, as a self-taught programmer, I found it very difficult to read. It seems a bit esoteric, even though it is vital knowledge. I think I’ll try to read the four volumes I have again. I think the first time through I skipped over the flow chart for reading the books. I’ll try to apply that this time through. I wonder how many people can honestly claim to have read and understood these volumes.
i agree, the volumes definitely require some advanced and specialized knowledge in math and computer science before one can start and understand them.
The simulator!
Are there _practically useful_ functions with this 'cannot be computed in an optimal way' in the sense he means? (Much like Paris and Harrington gave a mathematically meaningful example of a statement that could be stated but not proved within the language of PA.)
This is gold! Thanks for sharing!