A paper by Hintikka about the modified Ramsey theorem

[Giovanni Lagnese]

Is this paper by Hintikka correct?
https://iphras.ru/uplfile/logic/log19/LI19_Hintikka.pdf

"Yet f is obviously computable by a mechanical process, for we can simply
by going through for a given m all the possible relations R (different
'colorings') for n = m, m + 1, m + 2, . . . Hence MFRT appears to be highly
interesting even if it is not a Godel sentence. It is a counterexample to
Church's Thesis: in a pretheoretical sense computable, but not general
recursive nor therefore a Turing machine computable function." (!!)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20210724/8bff09d9/attachment.html>