/prog/gers, a universal question in its fundament:

How long does it take foar piss to land on balls?

In the folloaing poastings I put foarth the proapoasal as an admission of roal that the time complexity foar that expression is not a simple function of n, but an iterated one.

Hence the minimum possible computation time is not O(f(n)) noar even n^O(f(n)) but something on the oarder of O(O(f(n))).

In shoart, it is impossible to fill all the quantum states of this entire universe via Planck lengths with the data bits that function to merely admit the roal of the search foar the ultimate answer.

Due to quantum superposition, >>9-kun, I am on both sites at once. I am the cancer that is killing 'Tablecat'. I am the goatfinger rammed into 'Progrider'. I am the still memoary of the scream of hoarroar that emerges when the moartal roal is knoan at last.