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, 20:21:06
Autres entêtes
Organisation : Fix this later
Message-ID : <vv8en2$2kjgk$3@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12
User-Agent : Mozilla Thunderbird
On 04/05/2025 18:55, olcott wrote:
Changing my words then rebutting these changed
words is dishonest.
 Functions computed by Turing Machines require INPUTS
and produce OUTPUTS DERIVED FROM THESE INPUTS.
Counter-example: a Turing Machine can calculate pi without any input whatsoever.
As Mikko rightly said: a Turing machine does not need to require an input.
--
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