On Sun, Sep 16, 2007 at 06:57:22PM -0400, John Sowa wrote:
> Chris,
>
> A lot can be done with many NP-complete problems short of a general
> reduction of NP to P. And you don't need quantum computers to do
> so -- the floating-point processor on the average PC is sufficient. (01)
Well, of course that is true, John, but it's a bit tangential to the
point, right? The suggestion I was hearing was that complexity
limitations on computation were just a hard problem awaiting solution,
which just isn't so. But that isn't to say that nothing can be done
within those limitations if a problem turns out to be NP-complete or
even (in general) undecidable -- consider, e.g., full first-order
reasoners like Otter. (02)
-chris (03)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Subscribe/Config: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (04)
|