On Sun, 5 Mar 2000, dmolnar wrote:
> > Conjecture - For any axiomatic system, there exists a function which
> > runs in a practical amount of time which takes as inputs a statement in
> > that axiomatic system and a fixed length string,
>
> > such that given a proof of any statement in the axiomatic system it is
> > possible in a practical amount of time to construct a
> > string such that the function when given the statement and the string
> > will return true, but it is computationally intractable to find a false
> > statement and a string such that the function will return true.
Excuse me but I believe Godel's Incompleteness Theorem comes into play
here since even some true statements are intractable.
How do you propose to filter those out?
____________________________________________________________________
The future is downloading. Can you hear the impact?
O[rphan] D[rift>]
Cyber Positive
The Armadillo Group ,::////;::-. James Choate
Austin, Tx /:'///// ``::>/|/ [EMAIL PROTECTED]
www.ssz.com .', |||| `/( e\ 512-451-7087
-====~~mm-'`-```-mm --'-
--------------------------------------------------------------------
