Re: paper claiming p=np and soap bubbles

From: Jesse F. Hughes (jesse_at_phiwumbda.org)
Date: 07/09/04 

Date: Sat, 10 Jul 2004 00:51:51 +0200

gersh@bialer.com writes:

> 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

Relevant Pages

  • Re: Paper - impossible to prove P=?NP
    ... Let T be a consistent extension of PA. ... Then a Turing machine which simply produces the statement ... In the paper the notion of asymptotic proof is defined basicly as follows ... P and the universal polynomial time Turing machine accepts the proof ...
    (sci.crypt)
  • Re: An uncomputability conjecture, corrected version
    ... "Antti Ylikoski" kirjoitti ... which solves the problem and runs in a polynomial time. ... Turing machine that corresponds to R and solves the ... let be the set of input words to ...
    (comp.theory)
  • Re: paper claiming p=np and soap bubbles
    ... > macroscopic level can be modeled as a Turing machine, ... P are problems that take polynomial time on a deterministic ... A Turing machine can emulate nature. ... A deterministic Turing machine can emulate nature in polynomial ...
    (sci.math)
  • Re: paper claiming p=np and soap bubbles
    ... > macroscopic level can be modeled as a Turing machine, ... P are problems that take polynomial time on a deterministic ... A Turing machine can emulate nature. ... A deterministic Turing machine can emulate nature in polynomial ...
    (sci.physics)
  • Re: paper claiming p=np and soap bubbles
    ... > macroscopic level can be modeled as a Turing machine, ... P are problems that take polynomial time on a deterministic ... A Turing machine can emulate nature. ... A deterministic Turing machine can emulate nature in polynomial ...
    (comp.theory)