9 Jul
2023
9 Jul
'23
6:07 p.m.
after exploring this some i might be willing to start believing it! it helps to think of cryptography, and to recognize that the counterproof is within specific bounds. if f() is bounded to complete within a set timeframe unrelated to g(), then any given g() can be provided that is too complex for f() to analyse within this set timeframe …