Sujet : Re: Turing Machine computable functions apply finite string transformations to inputs
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 28. Apr 2025, 08:33:26
Autres entêtes
Organisation : Fix this later
Message-ID : <vunb06$2fjjl$5@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
User-Agent : Mozilla Thunderbird
On 28/04/2025 07:46, Fred. Zwarts wrote:
<snip>
So we agree that no algorithm exists that can determine for all possible inputs whether the input specifies a program that (according to the semantics of the machine language) halts when directly executed.
Correct?
Correct. We can, however, construct such an algorithm just as long as we can ignore any input we don't like the look of.
Similarly, we can construct a list that contains all possible real numbers just as long as we can ignore any iffy numbers that smell a funny colour.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within