Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

Three books reckon with technological complexity and the wicked problems it creates. The philosopher Karl Popper once argued that there are two kinds of problems in the world: clock problems and cloud ...

When it comes to hard problems, computer scientists seem to be stuck. Consider, for example, the notorious problem of finding the shortest round-trip route that passes through every city on a map ...

What’s the best way to solve hard problems? That’s the question at the heart of a subfield of computer science called computational complexity theory. It’s a hard question to answer, but flip it ...