> I don't think it is too much of a stretch to say nature can be modeled > by a turing machine in polynomial time. Otherwise, maybe Turing > machines should be redefined. I think the more complicated problem is > how you define. However, if quantum computers can theoretically > compute NP problems in P time, why shouldn't nature?
Boy, that paragraph is just chock-full, ain't it?
-- Jesse F. Hughes
"I have written many words to sci.math, some of them are not even meaningless." --Ross Finlayson