Hacker News new | ask | show | jobs
by ernesth 820 days ago
You do not need a different algorithm for each real. Just take the algorithm that proves the statement for rational p. It proves the statement for all reals bigger than p. (hence having as many algorithms as there are rational (countably many) is enough)
1 comments

Then that’s basically saying there is a O(n^2) algorithm which I dealt with in my first sentence.