my favorite "proof" of P = NP is that modern computing power grows exponentially so you can solve any NP-hard problem by waiting for a linear amount of time
Principal engineer at Mercury. I've authored the Dhall configuration language, the Haskell for all blog, and countless packages and keynote presentations.
I'm a midwife to the hidden beauty in everything.
đź’– @wiredaemon
my favorite "proof" of P = NP is that modern computing power grows exponentially so you can solve any NP-hard problem by waiting for a linear amount of time
Is this in a similar vein to arguing with a statistics teacher that every probability is 50%, because either it happens or it doesn’t