Chapter
Theoretical Computer Science and Machine Learning: A Discussion on Their Relationship
1:46:13 - 1:54:36 (08:23)
The hosts discuss the relationship between theoretical computer science and machine learning, touching on the topics of small circuits for specific problems and the history and progression of the machine learning field.
Clips
Professor Avi Wigderson discusses the P versus NP problem, which asks whether finding solutions is as easy as verifying them, and its implications for computer science and beyond.
1:46:13 - 1:50:54 (04:41)
Summary
Professor Avi Wigderson discusses the P versus NP problem, which asks whether finding solutions is as easy as verifying them, and its implications for computer science and beyond.
ChapterTheoretical Computer Science and Machine Learning: A Discussion on Their Relationship
Episode#111 – Richard Karp: Algorithms and Computational Complexity
PodcastLex Fridman Podcast
This podcast discusses the separation of the machine learning field from the theoretical computer science and computer science worlds, and how its empirical results for algorithmic performance differ.
1:50:55 - 1:54:36 (03:41)
Summary
This podcast discusses the separation of the machine learning field from the theoretical computer science and computer science worlds, and how its empirical results for algorithmic performance differ. It also highlights how reputations in machine learning can easily lead to millionaire status due to the high demand for AI in solving various problems.