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

Liste des GroupesRevenir à c theory 
Sujet : Re: Turing Machine computable functions apply finite string transformations to inputs
De : ben (at) *nospam* bsb.me.uk (Ben Bacarisse)
Groupes : comp.theory
Date : 05. May 2025, 02:13:21
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <87a57ramha.fsf@bsb.me.uk>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
User-Agent : Gnus/5.13 (Gnus v5.13)
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.

Date Sujet#  Auteur
17 Apr 26 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal