XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/30/2025 10:21 PM, olcott wrote:   
   > A Turing-machine decider is a Turing machine D that   
   > computes a total function D :  Σ∗ → {Accept,Reject},   
   > where Σ∗ is the set of all finite strings over the   
   > input alphabet. That is:   
   >   
   > 1. Totality: For every finite string input w ∈ Σ∗,   
   > D halts and outputs either Accept or Reject.   
   >   
   > Is simplified to this barest essence across all models of computation   
   > All deciders essentially: Transform finite string   
   > inputs by finite string transformation rules into   
   > {Accept, Reject} values.   
   >   
   > Anything that cannot be derived from actual finite string   
   > inputs is not computable and outside the scope of computation.   
   >   
      
   Can Carol correctly answer “no” to this (yes/no) question?   
   E C R Hehner. Objective and Subjective Specifications   
   WST Workshop on Termination, Oxford.  2018 July 18.   
   See https://www.cs.toronto.edu/~hehner/OSS.pdf   
      
   People can pretend that Bob is being asked   
   Carol's question and on the basis of this   
   false assumption say that Carol's question   
   has a correct answer.   
      
   --   
   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)