Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Philosophical Trials #7
Thomas Cormen is a world-renowned Computer Scientist, famous for co-writing the indispensable 'Introduction to Algorithms' textbook. He is currently a professor at Dartmouth College and former Chairman of the Dartmouth College Department of Computer Science. In 2013 he wrote a wonderful algorithmic book aimed at nonexperts which is entitled 'Algorithms Unlocked'. Professor Cormen also is well-known online for being Top Writer on Quora on numerous years, most recently in 2018. He is a great communicator of Computer Science and I hope you will enjoy the following conversation!
Outline:
00:00 Intro
00:16 The story of CLRS plus remarks on the 4th edition
11:39 Relationships between Competitive Programming, Software Engineering and academic Computer Science
13:16 What makes an algorithm beautiful?
16:33 Thoughts on P=NP
19:32 Algorithmic efficiency and Artificial General Intelligence
24:12 Will progress in fields such as Deep Learning make the study of classical algorithms obsolete?
27:37 Algorithms Unlocked
33:07 What should the average lay person know about algorithms?
37:46 Advice for students, both graduates and undergraduates
Enjoy!
Twitter:
https://twitter.com/tedynenu
Apple Podcasts:
https://podcasts.apple.com/gb/podcast/philosophical-trials/id1513707135
Spotify:
https://open.spotify.com/show/3Sz88leU8tmeKe3MAZ9i10
Google Podcasts:
https://podcasts.google.com/?q=philosophical%20trials
Instagram:
https://www.instagram.com/tedynenu/
Видео Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Philosophical Trials #7 канала Philosophical Trials
Outline:
00:00 Intro
00:16 The story of CLRS plus remarks on the 4th edition
11:39 Relationships between Competitive Programming, Software Engineering and academic Computer Science
13:16 What makes an algorithm beautiful?
16:33 Thoughts on P=NP
19:32 Algorithmic efficiency and Artificial General Intelligence
24:12 Will progress in fields such as Deep Learning make the study of classical algorithms obsolete?
27:37 Algorithms Unlocked
33:07 What should the average lay person know about algorithms?
37:46 Advice for students, both graduates and undergraduates
Enjoy!
Twitter:
https://twitter.com/tedynenu
Apple Podcasts:
https://podcasts.apple.com/gb/podcast/philosophical-trials/id1513707135
Spotify:
https://open.spotify.com/show/3Sz88leU8tmeKe3MAZ9i10
Google Podcasts:
https://podcasts.google.com/?q=philosophical%20trials
Instagram:
https://www.instagram.com/tedynenu/
Видео Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Philosophical Trials #7 канала Philosophical Trials
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Simon Blackburn on Philosophy, Truth and Morality | Philosophical Trials #2Cristian Presură despre Știință, Mecanică Cuantică și Filosofie | Philosophical Trials (RO) Ep. 2Scott Aaronson on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6Joel David Hamkins on Infinity, Gödel's Theorems and Set Theory | Philosophical Trials #1Timothy Williamson on Relativism and Vagueness | Philosophical Trials #8Tim Crane on Minds, Artificial Intelligence and Consciousness | Philosophical Trials #3Kai von Fintel on Language, Semantics and Possible Worlds | Philosophical Trials #5A Last Lecture by Dartmouth Professor Thomas CormenP vs. NP - The Biggest Unsolved Problem in Computer ScienceDonald Knuth: P=NP | AI Podcast ClipsEd Cooke on Memory Competitions, The Art of Remembering and Attention | Philosophical Trials #419. Dynamic Programming I: Fibonacci, Shortest PathsVlad Grigorescu despre Magie, Hipnoza si Psihologia Publicului | Philosophical Trials (RO) #1What is complexity theory? (P vs. NP explained visually)How to Learn Algorithms From The Book 'Introduction To Algorithms'What Computers Can't Do - with Kevin BuzzardSedgewick on why his Algorithms textbooks are so popularP vs. NP and the Computational Complexity ZooP vs NP on TV - ComputerphileBook Collection: Algorithms