272 | Leslie Valiant on Learning and Educability in Computers and People

<p>Science is enabled by the fact that the natural world exhibits predictability and regularity, at least to some extent. Scientists collect data about what happens in the world, then try to suggest "laws" that capture many phenomena in simple rules. A small irony is that, while we are looking for nice compact rules, there aren't really nice compact rules about how to go about doing that. Today's guest, Leslie Valiant, has been a pioneer in understanding how computers can and do learn things about the world. And in his new book, <a href="https://press.princeton.edu/books/hardcover/9780691230566/the-importance-of-being-educable" rel="noopener noreferrer" target="_blank"><em>The Importance of Being Educable</em></a>, he pinpoints this ability to learn new things as the crucial feature that distinguishes us as human beings. We talk about where that capability came from and what its role is as artificial intelligence becomes ever more prevalent.</p> <p>Blog post with transcript: <a href="https://www.preposterousuniverse.com/podcast/2024/04/15/272-leslie-valiant-on-learning-and-educability-in-computers-and-people/" rel="noopener noreferrer" target="_blank">https://www.preposterousuniverse.com/podcast/2024/04/15/272-leslie-valiant-on-learning-and-educability-in-computers-and-people/</a></p> <p>S<em>upport Mindscape on </em><a href="https://www.patreon.com/seanmcarroll" rel="noopener noreferrer" target="_blank"><em>Patreon</em></a><em>.</em></p> <p>Leslie Valiant received his Ph.D. in computer science from Warwick University. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. He has been awarded a Guggenheim Fellowship, the Knuth Prize, and the Turing Award, and he is a member of the National Academy of Sciences as well as a Fellow of the Royal Society and the American Association for the Advancement of Science. He is the pioneer of "Probably Approximately Correct" learning, which he wrote about <a href="https://www.amazon.com/Probably-Approximately-Correct-Algorithms-Prospering/dp/0465032710" rel="noopener noreferrer" target="_blank">in a book of the same name</a>.</p>