From classical to non-classical stochastic shortest path problems

From classical to non-classical stochastic sh...

Up next

Strachey Lecture: Use or Be Used - Regaining Control of AI

It’s said that Henry Ford’s customers wanted a “a faster horse”. If Henry Ford was selling us artificial intelligence today, what would the customer call for, “a smarter human”? That’s certainly the picture of machine intelligence we find in science fiction narratives, but the re ...  Show more

Advances in Garbled Circuits

MT25 Strachey Lecture - Professor Rafail Ostrovsky: Advances in Garbled Circuits Nearly 40 years ago, Andy Yao proposed the construction of “Garbled Circuits,” which had an enormous impact on the field of secure computation -- both in theory and in practice. In Garbled Circuits, ...  Show more

Recommended Episodes

Algorithms To Live By
What You Will Learn

There is a particular set of problems that all people face that are a direct result of the fact that our lives are carried out in finite space and time. What should we do? What should we ignore? What should we do today? What should be leave til next week? What degree of mess shou ...  Show more

Nature of Intelligence, Ep. 6: AI’s changing seasons
COMPLEXITY

Guest: Melanie Mitchell, Resident Professor, Santa Fe InstituteHosts: Abha Eli PhobooProducer: Katherine MoncurePodcast theme music by: Mitch MignanoFollow us on:Twitter • YouTube • Facebook • Instagram • LinkedIn • BlueskyMore info:Tutorial: Fundamentals of Machine LearningLectu ...  Show more

Networks and Complexity
Data Skeptic

In this episode, Kyle does an overview of the intersection of graph theory and computational complexity theory. In complexity theory, we are about the runtime of an algorithm based on its input size. For many graph problems, the interesting questions we want to ask take longer an ...  Show more