Get the latest tech news

Turing kicked us out of Heaven (2023)

The halting problem is why we can't have nice things.

The original algorithm was useful because it could potentially run forever, and capping the runtime takes that property away. (You'd have to figure out how to check if a specific problem took exponential time, but that's a lot easier than proving all of P vs NP!) The more general version of this is Rice's theorem: determining any non-trivial semantic property of a program is undecidable.

Get the Android app