Halting Problem A Jewish Coverup?

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

>>26
Yeah, it's hard to find infinite something that takes an arbitrarily small amount of resources to run as the input gets larger. But I have seen O(1/n) used for describing things like numerical error, where the size of the error would O(1/n), where n is the number of iterators performed, or something of the like.