All trust is economics

[Sarad AV]

hi,

--- John Kozubik <john at kozubik.com> wrote:
> On Sat, 26 Apr 2003, Tim May wrote:
> 

> Great fame would also wait anyone who proved that a
> significantly faster
> method _does not_ exist.  Not only is this
> conceivable, but it would move
> this second scenario much further along your scale
> of trust towards "1".

Proofs are build on existing knowledge of a system.How
ever the knowledge of a system is incomplete.That
always leaves scope for disproofs and emergence of new
proofs.




> I find that a lot of people (not necessarily anyone
> here) often forget
> that this possibility still exists as a possible
> conclusion in public key
> cryptography.

Lets wait and see if any one can proof If P=NP.Some
body  here suggested that it would be interesting if
the above problem is undecidable.


Regards Sarath.
> 
> -----
> John kozubik - john at kozubik.com -
> http://www.kozubik.com
> 


__________________________________
Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo.
http://search.yahoo.com