Halting Problem A Jewish Coverup?

What else could keep the goyim from discovering powerful algorithms than to keep them from even trying?

>>25
as soon as n > 1000000, then it takes the same amount of time to execute regardless of n, and becomes O(1)
Yeah, I just didn't feel like getting into all that.

and if it could invoke a program without using any time at all
I hadn't thought of that. You're right, in any real implementation there will be an O(1) part, so less than O(1) is impossible.