New Books in Science cover image

Chris Bleakley, "Poems That Solve Puzzles: The History and Science of Algorithms" (Oxford UP, 2020)

New Books in Science

00:00

How to Classify Algorithms According to the Fastest Algaritm

There is a real increase in computational complexity. And so what we can do is classify algarithms according to what's the fastest. So if an algarithm can be solved in polynomial time, it's calleda. It's put in the p class and there are some other classes as well. N p alderithms are a very slow to solve, even for moderate numbers of inputs. Researchers have been working on finding ways that they can solve n p problems in p time,. If you can prove or disprove this p versus n p problem, you'll get a million dollars.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app