Sujet : Re: And the Richer Petard Horror Show resumes HHH(DDD)==0
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 08. Oct 2024, 14:43:48
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <ve3cul$26g97$2@dont-email.me>
References : 1
User-Agent : Mozilla Thunderbird
On 10/8/2024 7:49 AM, Andy Walker wrote:
... after a short break.
Richard -- no-one sane carries on an extended discussion with
someone they [claim to] consider a "stupid liar". So which are you?
Not sane? Or stupid enough to try to score points off someone who is
incapable of conceding them? Or lying when you describe Peter? You
must surely have better things to do. Meanwhile, you surely noticed
that Peter is running rings around you.
Thanks for that part.
Peter -- you surely have better things to do. No-one sensible
is reading the repetitive stuff. Decades, and myriads of articles, ago
people here tried to help you knock your points into shape, but anything
sensible is swamped by the insults. Free advice, worth roughly what you
are paying for it: step back, and summarise [from scratch, not using HHH
and DDD (etc) without explanation] (a) what it is you think you are trying
to prove and (b) what progress you claim to have made. No more than one
side of paper. Assume that people who don't actively insult you are, in
fact, trying to help.
Most people that "try to help" do so only within the
foundational false assumption that I must be incorrect.
The DDD / HHH model is the simplest essence of my key points.
It only requires knowledge of software engineering thus
requires no knowledge of computer science.
This is the foundational axiom of my proof:
*Terminating is a property of finite string machine descriptions*
When I make key clarifications as I have made below those only
glancing at what I say never notice these key clarifications.
*Simulating Termination Analyzer HHH(DDD) rejects input DDD*
HHH is an emulating termination analyzer that takes the machine
address of DDD as input then emulates the x86 machine language
of DDD until a non-terminating behavior pattern is recognized.
HHH recognizes this pattern when HHH emulates itself emulating DDD
void DDD()
{
HHH(DDD);
return;
}
*Terminating is a property of finite string machine descriptions*
One cannot simply ignore the actual behavior specified by the
finite string such that
DDD emulated by each corresponding HHH that can possibly
exist never returns.
Thus each of these HHH emulators that does return 0 correctly
reports the above non-terminating behavior.
https://github.com/plolcott/x86utm x86utm operating system
Every executed HHH that returns 0 correctly reports that
no DDD emulated by its corresponding HHH ever returns.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer