4 ms·
Say you let n be a number equal to all of the memory bits that currently exist on Earth then showed that the size of the smallest boolean circuit solving 3SAT f
by tgflynn 9y ago
Say you let n be a number equal to all of the memory bits that currently exist on Earth then showed that the size of the smallest boolean circuit solving 3SAT for variable counts near n scaled as 2^n.
That would essentially be enough to convince me that P != NP.
It would be true for all practical purposes. In fact I would find the above information more interesting than the actual asymptotic behavior as n -> infinity.
- pavel_lishin 9y ago> It would be true for all practical purposes. But that's not how mathematical proofs work.
- ColinWright 9y agoYou're talking about something completely different. If you don't care about asymptotic behavior that's one thing, but you do need to recognise that you're talking about something different, and unless you are really clear and really precise you won't be able to communicate effectively with other people, even if what you say is relevant and important. But bottom line is that you're talking about something different.