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
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
