Some AI optimists tend to underestimate the difficulty curve of e.g. mathematical problems.

Brute-forcing a solution of length N is exponential time in N.

Proving a theorem of length N takes an uncomputably-fast increasing function of N.

CPU speed is great but sometimes only a better algorithm can save you.

· · Web · 0 · 0 · 0
Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!