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 : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theory
Date : 04. May 2025, 23:44:45
Autres entêtes
Organisation : Fix this later
Message-ID : <vv8qkt$2uhjq$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
User-Agent : Mozilla Thunderbird
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.
Not one I share, but definitely a point of view.
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within

Date Sujet#  Auteur
17 Apr 26 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal