AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
4min chapter
The First 80 years of AI, and What Comes Next | Oxford’s Michael Wooldridge
Johnathan Bi
Dividing Problems and the Limits of Search Algorithms in AI
This chapter delves into the 'divide and conquer' strategy in artificial intelligence, focusing on the challenges of NP-completeness in search algorithms. It uses the traveling salesman problem to illustrate how combinatorial explosion complicates exhaustive searches, hindering advancements in the field.
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode
Save any
moment
Hear something you like? Tap your headphones to save it with AI-generated key takeaways
Share
& Export
Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more
AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode