The quote that forms the title here comes from Lance Fortnow, a computer scientist at Northwestern University, in an article (here – subscription required) in the current edition of the New Scientist on the question.
It’s an odd statement for a computer scientist to make – most numbers are transcendental numbers and so are fundamentally incomputable: for instance there are (aleph null – the smallest of Cantor’s hypothesised infinities) transcendental numbers between 0 and 1 (or between any range of integers).
But besides that oddity it is actually a very good article – calling the world where Algorithmica – “the computing nirvana”.
I have written before of how much I hope we do live in Algorithmica, though the consensus is we live in a world of NDAlgorithmica (ND for non-deterministic).
The article’s beauty is that it also examines the states between the two: what if, for instance, we discovered that the class of problems were identical to the class of problems but that we could not find the algorithm, or that the algorithm was of such a degree of complexity it “would not amount to a hill of beans”?