XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/25/2025 10:32 PM, Richard Damon wrote:   
   > On 12/25/25 10:37 PM, olcott wrote:   
   >> On 12/25/2025 9:17 PM, Richard Damon wrote:   
   >>> On 12/25/25 10:12 PM, olcott wrote:   
   >>>> On 12/25/2025 8:44 PM, Richard Damon wrote:   
   >>>>> On 12/25/25 9:20 PM, olcott wrote:   
   >>>>>> On 12/25/2025 8:02 PM, Richard Damon wrote:   
   >>>>>>> On 12/25/25 8:45 PM, olcott wrote:   
   >>>>>>>> On 12/25/2025 5:39 PM, olcott wrote:   
   >>>>>>>>>   
   >>>>>>>>> https://chatgpt.com/share/694dcae3-a210-8011-b12f-a74007045a4a   
   >>>>>>>>>   
   >>>>>>>>   
   >>>>>>>> "Any result that cannot be derived as a pure function   
   >>>>>>>>   of finite strings is uncomputable."   
   >>>>>>>>   
   >>>>>>>> Deciders are not accountable for anything that   
   >>>>>>>> is not a pure function of their actual inputs.   
   >>>>>>>   
   >>>>>>> And the "Halting Function" *IS* a "Pure Function" of its input,   
   >>>>>>> so you are agreeing that your decider are accountable to being   
   >>>>>>> asked about the Halting of theinput.   
   >>>>>>>   
   >>>>>>>>   
   >>>>>>>> It is categorically impossible for there to   
   >>>>>>>> be a better measure of the actual behavior   
   >>>>>>>> that the actual input actually specifies   
   >>>>>>>> to H(P) that H computes as a pure function   
   >>>>>>>> of its actual input than P simulated by H.   
   >>>>>>>>   
   >>>>>>>   
   >>>>>>> WRONG, and that just shows how stupid you are.   
   >>>>>>>   
   >>>>>>   
   >>>>>> What is your actual reasoning to show that I am incorrect?   
   >>>>>> Calling be stupid seems to indicate that you are baffled.   
   >>>>>> It certainly does not indicate that I am incorrect.   
   >>>>>   
   >>>>> Because the measure is DEFINED by the problem.   
   >>>>>   
   >>>>   
   >>>> Three different LLMs have been totally convinced   
   >>>> a total of 50 times, you just don't understand.   
   >>>   
   >>> LLM LIE, so are not reliable sources.   
   >>>   
   >>   
   >> *Anyone that disagrees with this is not telling the truth*   
   >> "Any result that cannot be derived as a pure function   
   >>   of finite strings is uncomputable."   
   >>   
   >   
   > But Halting *IS* a "pure function of finite strings"   
   >   
   > And it is uncomputable   
   >   
      
   Not exactly. Usually ⟨M⟩ simulated by H == UTM(⟨M⟩)   
   Sometimes ⟨M⟩ simulated by H != UTM(⟨M⟩)   
      
   > Maybe you don't know what those words mean.   
   >   
   >> When the LLMs   
   >> (a) apply correct semantic entailment to   
   >> (b) standard definitions   
   >> any conclusions so derived are infallible by definition.   
   >   
   > How do they do that? I guess you don't know how a LLM works.   
      
   https://iep.utm.edu/val-snd/   
      
   >   
   >>   
   >> To see that this is actually the case in a specific   
   >> case only requires verifying that (a) and (b) are met.   
   >   
   > So try it.   
   >   
   > But first you need to know the meaning of the words.   
   >>   
   >> People here do not seem to have much of a clue what   
   >> semantic entailment** is thus are kind of helpless to   
   >> verify that it is correct.   
   >   
   > No, it seems YOU do not, as you don't understand what SEMANTICS are,   
   > since you don't let words actually mean what they mean in the context.   
   >   
   >>   
   >> **It has nothing to do with model theory.   
   >   
   > How said it did?   
   >   
   > Your roblem is you live in a fantasy world where you fight windmills   
   > that don't exist, and ignore the facts that do.   
   >   
   > THe fact that you continue to just quote your garbage, and not even TRY   
   > to respond to the errors being pointed out, just shows that you   
   > understand is so poor, you don't even understand the errors being   
   > pointed out.   
      
      
   --   
   Copyright 2025 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)