On 02/07/2026 17:51, olcott wrote:His halt decider did not look at its input.>It is a valid example of a C program. It was present as a part of a
Do you know enough about C to understand that
dbush example was foolish nonsense when proposed
to show the halting problem counter-example?
claim about you, and your response was the false claim that "That
is just nonsense". Later in the discussion you offer more evidence
to support his claim.
His input merely halted and did not call
this halt decider. He used {} in a way that
made no sense in C.
--
Copyright 2026 Olcott
My 28 year goal has been to make
"true on the basis of meaning expressed in language"
reliably computable for the entire body of knowledge.
The complete structure of this system is now defined.
The entire body of knowledge expressed in language is
comprised of two types of relations between finite strings:
(a) *Axioms* Expressions of language that are stipulated to be true.
My system bridges the analytic/synthetic distinction by
expressly encoding all empirical "atomic facts" in a formal
language such as CycL of the Cyc project.
(b) *Inference Rules* Expressions of language that are semantically
entailed syntactically from (a) and/or (b).
Les messages affichés proviennent d'usenet.