David Brown wrote:
Without it, I've not proven what I intended to prove. Otherwise, we don't
know if there isn't some yet-undiscovered algorithm out there that solves
the problem more efficiently. If we can prove that all algorithms must use
either O(2^2^n) space or time, the conclusion follows.
Yes, but that's a really hard problem, which is the point I'm making. :-)
Actually, proving this would probably lead to all kinds of good stuff
coming out of it for compiler theory and such.
"The Traveling Salesman Problem: A problem that has been vexing computer
scientists for many decades, but which traveling salesmen solve on a
daily basis."
--
Darren New / San Diego, CA, USA (PST)
It's not feature creep if you put it
at the end and adjust the release date.
--
[email protected]
http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
