Sujet : Re: Can D simulated by H terminate normally?
De : noreply (at) *nospam* example.com (joes)
Groupes : comp.theoryDate : 03. May 2024, 21:30:57
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v13e1h$2uk84$6@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Fri, 03 May 2024 07:25:47 -0500 schrieb olcott:
On 5/2/2024 8:48 PM, Richard Damon wrote:
Yes, there are a LOT of non-terminating programs that can be detected.
The problem is that when you make H and D actual programs, if H(D,D)
returns 0, then D(D) is NOT a "non-terminating" program.
Now, part of the issue is that this form of Termination Analysis isn't
as concerned about being able to be 100% for every possible program, but
wants to look at what classes of programs CAN be very reliably decided on.
So yes, it is RELATED to halting, but has a different criteria for what
is considered a solution. In part, because they KNOW that 100% accuracy
on EVERY program is impossible, so they want to study what CAN be done.
In the field, rejecting "hostile" programs that are trying to be
intentionally hard to decide isn't considered a failure.
YOU TRIED TO CHANGE THE SUBJECT AWAY FROM THIS.
I ONLY GLANCED AT A FEW OF YOUR WORDS TO TELL THAT YOU
TRIED TO CHANGE THE SUBJECT. ONCE I CAN TELL THAT YOU
ARE TRYING TO CHANGE THE SUBJECT I QUIT READING.
This reminds me a lot of what you accused us of
(reading only the beginning and jumping to conclusions).
-- joes