From: "deering" <[EMAIL PROTECTED]>
It should be a fairly obvious implementation of a nested quantum computer
to run any of these infinite processing programs. We will soon have oracle
type computers that can answer any question with the reservation that the
top level of the nest will have to be large enough to hold both the
question and the answer. Current quantum computers are at the 3 or 4 bit
level but scientists are confident of exponential advancement in future
development. Of course then the problem will be, "Are you smart enough to
understand the answer?"
You radically overstate the expected capabilities of quantum computers. They
can't even do NP-complete problems in polynomial time.
http://scottaaronson.com/blog/?p=208
_________________________________________________________________
Advertisement: Fresh jobs daily. Stop waiting for the newspaper. Search Now!
www.seek.com.au
http://a.ninemsn.com.au/b.aspx?URL=http%3A%2F%2Fninemsn%2Eseek%2Ecom%2Eau&_t=757263760&_r=Hotmail_EndText_Dec06&_m=EXT
-----
This list is sponsored by AGIRI: http://www.agiri.org/email
To unsubscribe or change your options, please go to:
http://v2.listbox.com/member/?list_id=11983
