On 3/6/07, Mitchell Porter <[EMAIL PROTECTED]> wrote:
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
What about a computer (classical will do) granted an infinity of cycles through, for example, a Freeman Dyson or Frank Tipler type mechanism? No matter how many cycles it takes to compute a particular simulated world, any delay will be transparent to observers in that world. It only matters that the computation doesn't stop before it is completed. Stathis Papaioannou ----- 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
