Philosophical Trials

Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Episode 7

June 24, 2020 Tedy Nenu Episode 7
Philosophical Trials
Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Episode 7
Chapters
Philosophical Trials
Thomas Cormen on The CLRS Textbook, P=NP and Computer Algorithms | Episode 7
Jun 24, 2020 Episode 7
Tedy Nenu

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!

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

Apple Podcasts

Spotify

Google Podcasts

YouTube

Instagram

Show Notes

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!

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

Apple Podcasts

Spotify

Google Podcasts

YouTube

Instagram