Re: Turing Machine computable functions apply finite string transformations to inputs

Richard Heathfield <rjh@cpax.org.uk> writes:

On 04/05/2025 23:34, Mr Flibble wrote:

The function is neither computable nor incomputable because there is no
function at all, just a category error.

>
It's a point of view.

It's a point of view only in the sense that there is no opinion so daft
that it's not someone's point of view.  The technical-sounding waffle
about it being a "category error" is simply addressed by asking where
the supposed category error is in other perfectly straightforward
undecidable problems.  For example, whether or not a context-free
grammar is ambiguous or not, or the very simple to pose Post
correspondence problem.

--
Ben.