|
|
|
|
|
|
by vlovich123
1773 days ago
|
|
|
Oh, and I’m going to read [1] now. I thought the heading was timely and lovely since we were discussing this and I look forward to reading it (I haven’t yet so I do t know what the article says yet) [1] https://news.ycombinator.com/item?id=28167835 |
|
|
> 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.