> No method of computing carried out by a mechanical process can be more powerful than a Turing machine.
Although widely adopted, as there is no clear way to prove or disprove its validity the proposition still remains a conjecture.
I think that’s what we’re basically discussing, right? Still, the way that’s phrased puts it into the P!=NP camp for me so I think you may be right.
> No method of computing carried out by a mechanical process can be more powerful than a Turing machine. Although widely adopted, as there is no clear way to prove or disprove its validity the proposition still remains a conjecture.
I think that’s what we’re basically discussing, right? Still, the way that’s phrased puts it into the P!=NP camp for me so I think you may be right.