On Sun, 5 Mar 2000, Jim Choate wrote:

> 
> 
> On Sun, 5 Mar 2000, dmolnar wrote:

Just a note - the conjecture is due to [EMAIL PROTECTED] and can be found on
his web page. My apologies if including it in my post caused any
confusion. 

> 
> > > 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.

Reply via email to