XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 1/13/2026 8:23 AM, Tristan Wibberley wrote:   
   > On 13/01/2026 09:11, Mikko wrote:   
   >> An oracle machine may be   
   >> able to determine the haltinf of all Turing machines but not of all   
   >> oracle machines with the same oracle (or oracles) so it is not   
   >> universal.   
   >   
   > What's the formal definition of "an oracle machine" ?   
   >   
   > I would have thought an oracle always halts because it's an oracle it   
   > answers every question that has an answer with either "HasAnswer answer"   
   > or "HasNoAnswer".   
   >   
      
   It seems outside of computer science and into fantasy.   
   https://en.wikipedia.org/wiki/Oracle_machine   
      
   --   
   Copyright 2026 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)