Liste des Groupes | Revenir à c theory |
On 3/7/2025 8:44 PM, dbush wrote:On 3/7/2025 9:42 PM, olcott wrote:On 3/7/2025 8:23 PM, dbush wrote:That you don't understand that termination analyzers and halt deciders>Yes I did grossly over-estimate you technical knowledge.
We know termination analyzers don't exist because no algorithm exists
that maps the halting function:
(<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
(<X>,Y) maps to 0 if and only if X(Y) does not halt when executed
directly
Are you a mere troll then?
are stipulated to map the halting function is not a rebuttal.
In computer science, termination analysis is program analysis whichAHA HAHAHA
attempts attempts attempts attempts attempts to determine whether the
evaluation of a given program halts for each input.
https://en.wikipedia.org/wiki/Termination_analysis
I switched to the term {termination analyzer} because they are not
required to be infallible.
infallible or wrong is a stupid dichotomy.
Les messages affichés proviennent d'usenet.