Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs --- MT
De : dbush.mobile (at) *nospam* gmail.com (dbush)
Groupes : comp.theoryDate : 07. May 2025, 13:01:15
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvfi2a$10b0m$4@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 25 26 27 28 29
User-Agent : Mozilla Thunderbird
On 5/7/2025 6:16 AM, Fred. Zwarts wrote:
Op 06.mei.2025 om 21:15 schreef olcott:
None-the-less it is the words that the best selling
author of theory of computation textbooks agreed to:
*would never stop running unless aborted*
>
is the hypothetical HHH/DD pair where the same HHH
that DD calls does not abort the simulation of its input.
>
Nevertheless, this change makes it fundamentally different.
I can't believe that you are so stupid to think that modifying a program does not make a program different. Are you trolling?
Given that he's shown he doesn't understand (and this list is by no means exhaustive):
* what requirements are
* what correct means
* what true means
* what a proof is
* how proof by contradiction works
I wouldn't put it past him that he actually believes it. He'll say anything to avoid admitting to himself that he wasted that last 22 years not understanding what he was working on.
(Anyone else that wants to add to this list, feel free)