News for hackers. Stuff that matters.
Re:On Norbert Blum’s claimed proof that P does not equal NP by ColinWright on Wednesday August 16, 2017 @04:10PM (#15030881)
> I don't see how it could be unprovable.

It's quite plausible that it's unprovable, although you would have to be specific about the axiom system you're using.

> As far as I know the only way a theorem can be unprovable is if it makes statements involving infinity.

It does.

> You can reduce P vs NP to a question involving only finite sets by choosing some finite n, which can be arbitrarily large. It should be large enough so that the asymptotic behavior of any algorithm would dominate at n.

No, you can't. You don't know how large that n has to be, so you have to prove it for arbitrarily large n, and that's the "infinity" that you're dismissing.

> Instead of asking about the scaling behavior of an algorithm as n approaches infinity you now ask about its scaling up to the finite value n.

So you've changed the question to one that can be proven. The original question might still be unprovable.

So I don't see how your comment really makes any sense at all. Perhaps you could be a little more precise.

Re:On Norbert Blum’s claimed proof that P does not equal NP by tgflynn on Wednesday August 16, 2017 @04:41PM (#15031195)
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.

Re:On Norbert Blum’s claimed proof that P does not equal NP by ColinWright on Wednesday August 16, 2017 @05:36PM (#15031588)
You'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.

Re:On Norbert Blum’s claimed proof that P does not equal NP by pavel_lishin on Wednesday August 16, 2017 @05:18PM (#15031458)
> It would be true for all practical purposes.

But that's not how mathematical proofs work.