Re: A way for P!=NP
From: Daniel McLaury (daniel_mcl_at_hotmail.com)
Date: 09/21/04
- Next message: James Harris: "Re: JSH: Algebraic integers, a special case"
- Previous message: Mensanator: "Re: 64 - is this the only number that is both a sq and a cube?"
- In reply to: Denis Flex: "Re: A way for P!=NP"
- Next in thread: Craig Feinstein: "Re: A way for P!=NP"
- Messages sorted by: [ date ] [ thread ]
Date: 20 Sep 2004 18:44:45 -0700
"Yes but I think that a logical formula is a polynomial complexity
program."
What do you mean by this? It does not make sense, and that is what is
wrong with your argument. Pc is a program with recursion; you cannot
express its return value as a logical formula (unless perhaps you know
the return values in advance; this is not the problem you are trying to
solve, however.)
- Next message: James Harris: "Re: JSH: Algebraic integers, a special case"
- Previous message: Mensanator: "Re: 64 - is this the only number that is both a sq and a cube?"
- In reply to: Denis Flex: "Re: A way for P!=NP"
- Next in thread: Craig Feinstein: "Re: A way for P!=NP"
- Messages sorted by: [ date ] [ thread ]