- 166
- 258 533
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.
Переглядів: 146
Відео
Pearl: "I apologize for being so stupid" by treating causality as a probabalistic relationship.
Переглядів 1665 місяців тому
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.
Переглядів 1905 місяців тому
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.
Переглядів 1415 місяців тому
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.
Переглядів 395 місяців тому
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.
Переглядів 1365 місяців тому
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.
Переглядів 715 місяців тому
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
Переглядів 2095 місяців тому
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.
Переглядів 835 місяців тому
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."
Переглядів 2255 місяців тому
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."
Переглядів 1625 місяців тому
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.
Переглядів 2955 місяців тому
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
Переглядів 3,9 тис.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,5 тис.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 тис.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,4 тис.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,5 тис.4 роки тому
Kahan on the 8087 and designing Intel's floating point
Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson
Переглядів 5934 роки тому
Kahan remembers JCP Miller, Maurice Wilkes & Jim Wilkinson
Kahan on the FERUT, the first computer he programmed
Переглядів 7464 роки тому
Kahan on the FERUT, the first computer he programmed
Feigenbaum on IntelliCorp and Teknowledge
Переглядів 1784 роки тому
Feigenbaum on IntelliCorp and Teknowledge
Feigenbaum on editing Computers and Thought
Переглядів 1554 роки тому
Feigenbaum on editing Computers and Thought
Feigenbaum on the Heuristic Programming Project and DENRAL
Переглядів 6284 роки тому
Feigenbaum on the Heuristic Programming Project and DENRAL
Feigenbaum on EAPM, his Ph.D. project with Herb Simon
Переглядів 1664 роки тому
Feigenbaum on EAPM, his Ph.D. project with Herb Simon
Feigenbaum on working with Herb Simon and John Backus
Переглядів 2184 роки тому
Feigenbaum on working with Herb Simon and John Backus
Feigenbaum on his family background and love of science
Переглядів 2084 роки тому
Feigenbaum on his family background and love of science
Goldwasser defines a Probabilistically Checkable Proof
Переглядів 8624 роки тому
Goldwasser defines a Probabilistically Checkable Proof
Goldwasser on Kilian, Schoof and primality
Переглядів 4014 роки тому
Goldwasser on Kilian, Schoof and primality
Goldwasser defines zero knowledge proofs
Переглядів 8 тис.4 роки тому
Goldwasser defines zero knowledge proofs
What could we do without the Jews? There is always one that makes the difference! Abraham was the first one. Hundreds followed. And they are only 0.015% of the world population holding almost 1/3 of the Nobel prizes.
this geek did it for the money. science has been bought and paid for. lmao he should pay
I appreciate his attention to detail.
I would like a longer tape, or the whole tape, without sudden interruptions at the end. 😢
As it says in the video description: Video of the full interview is available as part of Kahan’s ACM profile at amturing.acm.org/award_winners/kahan_1023746.cfm. Just follow the link, then click "Video Interview".
Legend ❤
cool
Thank you Mr. Aho, I use awk all the time, because it is quickie.
Goes back to those who use the product and those who don't. Those who use calculators understand what is needed.
it's crazy think that this man is 80 years old
"It felt nice having solved an impossible problem." I love it when CS gurus make me laugh out loud.
u didnt interview him in a bakery? it would have been fitting to interview in a bakery with several croissants on the table
I have learned much indeed over the decades from your: "The Art of Computer Programming, Volume 2: Seminumerical Algorithms." Thank you, sir. --
SO a latin square problem where you have x number of 1's and y number of 2's each row and column. If it's just 1's and 2's can it be reduced to 2 sat. I'd love to know surely it's quicker to solve than one with more variety of numbers. if you can solve 2 different number latin squares of any size in p time then I know how that could be useful for gaining clues to latin squares using many more numbers.
Thanks for the insight. I didn't know about the Latin square problem.
Very entertaining and insightful interview. Adleman is a great story teller!
Hero.
Thank you for your amazing contributions! My first HP calculator was the HP-45, pretty early model, followed by several work calculators. They were and still are a reliable point in life.
My first HP calculator was the HP41C. It cost me more than $400 in 1981, but it was worth every penny. In 2024 dollars, it would be equivalent to around $1,500 today.
Manuel Blum, orgullo venezolano.
genius. o7
"subtypes behave like supertypes.", short and clear, end al the confusions
Subtype behaviour like SuperType
constant is :
Absolute Sigma Move
I have both a 28C and a 28S calculator and despite their age, they are far superior to anything I've seen since. The only negative is the poor screen, which is sometimes difficult to read. Once you get used to PRN it's so easy and reliable - no more guesswork as to whether to enter √2 or 2√ like on other calculators.
I've had an HP-55, HP-67, and HP-41c. I've got an emulator for the 48/49 series as well as the Prime on my phone now. The one thing I miss is the tactile feeling of the solid click of the HP keyboards. It's probably because I started working with computers very early on that RPN appealed to me so much. I've always been able to think in better in those terms than relying on how the calculator is programmed to interpret algebraic notation. It's great hearing the thoughts of the people involved in creating and programming of these calculators.
It doesn't seem to matter how smart or dumb someone is, the magical thinking of determinism grips their psyche like a leach and won't let go.
_yawn_ I'm sure the guy (as well as many others in computer science) had their hay day back in the day and deserve respect for it, but everyone's trying to be guru legend nowadays. It's so tiring. Current day social media markets egging it on.
"I look at mutual exclusion not as a programming problem, not as a mathematical problem, but a physics problem."
"C++ the worst disease ever created" - ha ha ha
How much confusion there is out there about this principle.
2024 👌🏻
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.
@@aymantimjicht173 This has nothing to do with axioms. Search for ”zero knowledge proof”. Alsow what community image?
@@aymantimjicht173 Read from wikipedia what zero knowledge proof means. It has nothing to do with axioms.
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.