Liste des Groupes | Revenir à theory |
On 6/9/2025 10:06 AM, dbush wrote:However, because HHH aborts its simulation,On 6/9/2025 10:55 AM, olcott wrote:I admit that:On 6/9/2025 6:55 AM, dbush wrote:Then you admit that that finite string includes the machine code of the function DDD, the machine code of the function HHH, and the machine code of everything that HHH calls down to the OS level, and that address 000015c3 is part of DDD?On 6/9/2025 12:15 AM, olcott wrote:It is proven that you are a liar by the part ofOn 6/8/2025 10:42 PM, dbush wrote:Which you stated only includes the instructions of the function DDD on multiple occasions (see below),On 6/8/2025 11:39 PM, olcott wrote:There you go.On 6/8/2025 10:32 PM, dbush wrote:But they take a description/specification of an algorithm,On 6/8/2025 11:16 PM, olcott wrote:My understanding is deeper than yours.On 6/8/2025 10:08 PM, dbush wrote:That you think that shows thatOn 6/8/2025 10:50 PM, olcott wrote:That is stupidly counter-factual.void DDD()No it's not, as halt deciders / termination analyzers work with algorithms,
{
HHH(DDD);
return;
}
The *input* to simulating termination analyzer HHH(DDD)
No decider ever takes any algorithm as its input.
which is what is meant in this context.It turns out that this detail makes a big difference.
And because your HHH does not work with the description/ specification of an algorithm, by your own admission, you're not working on the halting problem.HHH(DDD) takes a finite string of x86 instructions
my reply that you erased.
HHH(DDD) takes a finite string of x86 instructions
that specify that HHH simulates itself simulating DDD.
(a) DDD correctly simulated by HHH,
(b) the directly executed DDD() and
(c) the directly executed HHH()
WOULD NEVER STOP RUNNING UNLESS
HHH ABORTS ITS SIMULATION OF DDD.
Les messages affichés proviennent d'usenet.