Re: H(D,D) cannot even be asked about the behavior of D(D) V2

On 6/16/2024 6:26 PM, Richard Damon wrote:

On 6/16/24 6:21 PM, Python wrote:

Le 16/06/2024 à 23:58, André G. Isaak a écrit :

On 2024-06-16 15:06, Alan Mackenzie wrote:
>

If you'd've simply stuck to turing machines all along, you could have
avoided a lot of the confusion you've got yourself into.  Why not start
talking about turing machines now?

>
Olcott has made it clear that he has absolutely no idea what Turing Machines are or how they work. He likes bringing them up (even insisting on calling his C programs "TMs" or "UTMs"), but there's no possibility that he will start discussing actual Turing machines. They're entirely outside of his purview.
>
André
>

>
A couple of years ago he was asked to provide Turing Machine emulator in
C. He bragged about delivering it in a few hours (which is realisting
for any decent programmer btw).
>
Guess what? He failed.
>
>

 Actually, if I remember right, he was asked to write a Turing Machine, and was shown an on-line Turing Emulator, but he didn't like how it worked, (it didn't understand a "full ASCII" tape) so he desided to write his own, and failed.
 Yes, a few hours is probably a reasonable design time for a simple "batch mode" Turing machine emultor (read a data file with the State Machine description and the starting tape, and then print a trace of it running, maybe including a simple loop detector to stop the obviously non-halting machines.
 Of course, fancy graphics could make it a bottomless pit.
 I likely wouldn't choose C to do it in, but it is do able.
 (A RASP emulator would want a language with bignum support, but that isn't needed for a Turing Machine.

The x86 language <is> essentially a RASP machine for
every computation that fits within its memory.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer