Re: Unpartial Halt Deciders

Mr Flibble <flibble@red-dwarf.jmc.corp> writes:

On Fri, 18 Apr 2025 12:25:36 -0700, Keith Thompson wrote:

Mr Flibble <flibble@red-dwarf.jmc.corp> writes:

I, aka Mr Flibble, have created a new computer science term, the
"Unpartial Halt Decider".  It is a Halt Decider over the domain of all
program-input pairs excluding pathological input (a manifestation of
the self referencial category error).

[...]
 
Do you have a rigorous definition of "pathological input"?
 
Is there an algorithm to determine whether a given input is
"pathological" or not?
 
I could define an is_prime() function like this:
 
    bool is_prime(int n) {
        return n >= 3 && n % 2 == 1;
        // returns true for odd numbers >= 3, false for all others
    }
 
I'll just say that odd numbers that are not prime are pathological
input, so I don't have to deal with them.

>
Pathological input:
>
Self-referencial to the decider.

OK.

Do you have a *rigorous* definition of "pathological input"?

Is there an algorithm to determine whether a given input is
"pathological" or not?

--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */