Sujet : Re: Philosophy of Computation: Three seem to agree how emulating termination analyzers are supposed to work
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 11. Nov 2024, 16:53:26
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <da2380e1d90ee7ec9e8b461eebaf8bf7386e74fd@i2pn2.org>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 11/11/24 10:18 AM, olcott wrote:
On 11/11/2024 5:33 AM, Mikko wrote:
OP says nothing aobut how emulationg termination analyzers are supposed to
work.
When I provide direct access to fully operational code
https://github.com/plolcott/x86utm/blob/master/Halt7.c
your statement becomes a bald faced lie.
Except that your code isn't an example of how they are SUPPOSED to work,
After all, every one of your claimed examples says that its input is non-halting, when in fact, when we run that input, per the DEFINITION of a termination analyzer, they halt.
Termination Analyzers are just incorrect to indicate that a halting program is non-halting.
All you are doing is proving your ignorance of the systems you are trying to claim making breakthroughs in.
I think that is OK. Philosophers may have opinions about that but
the question is not really relevant for theorieticsl or practical purposes.
>
Anyone who wants to present or sell an emulating termination analyzer should
tell what that particular analyzer actually does.
>