Halting Problem A Jewish Coverup?

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

>>21
Although, assuming that is straight C, that technically isn't O(1/n), because as soon as n > 1000000, then it takes the same amount of time to execute regardless of n, and becomes O(1). If it was some special computer that could stall for an infinitely precise amount of time, and if it could invoke a program without using any time at all, then it would be though.