Sujet : Re: Proving the: Simulating termination analyzer Principle
De : jameskuyper (at) *nospam* alumni.caltech.edu (James Kuyper)
Groupes : comp.lang.cDate : 06. Apr 2025, 01:54:54
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vssjcu$3l5ki$1@dont-email.me>
References : 1 2 3 4 5 6
User-Agent : Mozilla Thunderbird
On 06/04/2025 00:18, olcott wrote:
...
Termination analyzers are not required to be infallible.
The Halting Problem refers to the impossibility of an infallible
termination analyzer. Fallible termination analyzers are trivially
possible - the question's not worth thinking about.