News for hackers. Stuff that matters.
Re:Some Fundamental Theorems in Mathematics by ccalf on Wednesday January 30, 2019 @07:46PM (#19041204)
I think it's clearer to understand the Church-Turing thesis as two theses, not one. Turing's thesis was that (intuitive) computability equals (formalizable) Turing computability.

So you could completely ignore the recursive functions part (and so, Church's Thesis) and there would still be the same sort of lay confusion about the computability thesis.

There are no comments on this comment yet.