Re:On Two Views of Computation in Computer Science
by tome on Thursday September 01, 2016 @05:03AM
(#12403851)
Yes he does. If by "Which functions nat -> nat are computable" he meant "functions written in some typed language" then the answer is vacuously "all of them".
Re:On Two Views of Computation in Computer Science
by pron on Thursday September 01, 2016 @06:18AM
(#12404122)
Not all functions of type nat -> nat are computable in any formalism. You can write plenty of programs that are really of type nat -> nat in say, Haskell, that try to compute a non-computable natural function. They just can't do it and they'll never terminate for some inputs. But they're still perfectly well-formed.
See also https://news.ycombinator.com/item?id=12403508