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
Languages:
English - Fluent
Svenska - Jag lär mig
See also: @artistichadron
Certifiable Degenerate
Ask me stuff!
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