CDR: Re: why should it be trusted?

[petro]

>>Could a factoring breakthrough happen to convert this exptime problem
>>to polynomial time? Maybe. I said as much. Is it likely? See
>>discussions on progress toward proving factoring to be NP-hard (it
>>hasn't been proved to be such, though it is suspected to be so, i.e.,
>>that there will never be "easy" methods of factoring arbitrary large
>>numbers).
>
>Geee...  Since when are problems "proven" to be NP-hard??  Go back to your
>favorite undergrad institution and take a course on computational
>complexity again.

	Are you literate?
-- 
A quote from Petro's Archives:   **********************************************
Sometimes it is said that man can not be trusted with the government 
of himself. Can he, then, be trusted with the government of others? 
Or have we found angels in the forms of kings to govern him? Let 
history answer this question. -- Thomas Jefferson, 1st Inaugural