Sujet : Re: Proving the: Simulating termination analyzer Principle
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.lang.cDate : 14. Apr 2025, 00:26:40
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vthh7h$3uil9$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
User-Agent : Mozilla Thunderbird
On 4/13/2025 4:50 PM, Chris M. Thomasson wrote:
On 4/13/2025 12:56 PM, olcott wrote:
On 4/13/2025 2:38 PM, Chris M. Thomasson wrote:
On 4/13/2025 5:03 AM, olcott wrote:
On 4/11/2025 3:00 PM, Chris M. Thomasson wrote:
On 4/11/2025 7:42 AM, olcott wrote:
On 4/10/2025 10:00 PM, Chris M. Thomasson wrote:
On 4/10/2025 3:53 PM, olcott wrote:
On 4/9/2025 11:04 PM, Chris M. Thomasson wrote:
On 4/9/2025 7:02 PM, olcott wrote:
On 4/9/2025 6:39 PM, Chris M. Thomasson wrote:
On 4/9/2025 10:18 AM, olcott wrote:
On 4/9/2025 1:00 AM, Chris M. Thomasson wrote:
On 4/5/2025 8:26 PM, olcott wrote:
[...]
Of course not that is a very dumb question.
You are asking if it can carefully examine
all of the details of what it is not allowed to see.
>
Does your halt decider work or not?
>
>
A variant of HHH had been a correct termination analyzer
on its domain of inputs for several years.
https://github.com/plolcott/x86utm/blob/master/Halt7.c
[...]
>
Is domain of inputs? So, an input for your "thing" cannot be crafted by a third party?
>
It is not that hard, why do you pretend that it is?
Have you ever heard of a domain of inputs?
>
Don't tell me its something akin to:
<code typed in the news reader, sorry for any typos!>
____________________________
#include <stdio.h>
static
unsigned long
iter_0(
unsigned long ri,
unsigned long rn
);
unsigned long
iter_1(
unsigned long ri,
unsigned long rn
) {
if (ri > rn) return 666;
printf("iter_1 %lu %lu\n", ri, rn);
return iter_0(ri + 1, rn);
}
unsigned long
iter_0(
unsigned long ri,
unsigned long rn
) {
if (ri > rn) return 42;
printf("iter_0 %lu %lu\n", ri, rn);
return iter_1(ri + 1, rn);
}
int main()
{
unsigned long ri = 0;
unsigned long rn = 42;
unsigned long result = iter_0(ri, rn);
printf("\nresult = %lu\n", result);
return 0;
}
____________________________
?
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithms, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.e. *given an input of the function domain* it can return the corresponding output.
https://en.wikipedia.org/wiki/Computable_function-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
Proving the: Simulating termination analyzer Principle
Re: Proving the: Simulating termination analyzer Principle