complexity

The pioneering mathematician talks about his work, computer science and artificial intelligence.

We talk to pioneering mathematician Stephen Cook, who came up with the concept of NP-complete problems, about his work, computer science, and artificial intelligence.

There are problems that are easy to solve in theory, but impossible to solve in practice. Intrigued? Then join us on a journey through the world of complexity, all the way to the famous P versus NP conjecture.

Quantum particles that are both light and matter help solve infamous NP hard problems.

The simple act of packing your luggage can open a complex can of worms.

How fast can you tell whether two networks are the same?

Are there problems computers will never be able to solve, no matter how powerful they become?

A famous question involving networks appears to have come closer to an answer.

What will quantum computers be able to do that ordinary computers can't do?

Kolmogorov complexity gives a high value to strings of symbols that are essentially random. But isn't randomness essentially meaningless? Should a measure of information assign a low value to it? The concept of sophistication addresses this question.