On 31-Dec-02, Hal Finney wrote: > One correction, there are no known problems which take exponential > time but which can be checked in polynomial time. If such a problem > could be found it would prove that P != NP, one of the greatest > unsolved problems in computability theory.
What about Hamiltonian circuits or factoring an integer or roots of a Diophantine equation? Brent Meeker "Just when I thought things couldn't get worse, I installed Windows XP." --- DaveP