XPost: comp.theory, comp.ai.philosophy, sci.math   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 19/11/2025 17:48, Kaz Kylheku wrote:   
      
   > Recursive functions and Turing machines are equivalent. The halting   
   > problem is about recursive functions too.   
      
   There exists an equivalent ...   
      
      
   > In any case, topics in the halting problem cannot be properly explored   
   > using impure procedures --- not in such a way that we assume that those   
   > procedures directly correspond to recursive functions.   
      
   No. The Halting Theorem has no problems demonstrable with leaky   
   simulation (emulation) sandboxes.   
      
   Topics can be explored with leaky sandboxes, topics such as "How can   
   leaky sandboxes and their effects be characterised?" and "What are the   
   relationships between various recursive functions and various Turing   
   Machines and their generalisations?"   
      
      
   --   
   Tristan Wibberley   
      
   The message body is Copyright (C) 2025 Tristan Wibberley except   
   citations and quotations noted. All Rights Reserved except that you may,   
   of course, cite it academically giving credit to me, distribute it   
   verbatim as part of a usenet system or its archives, and use it to   
   promote my greatness and general superiority without misrepresentation   
   of my opinions other than my opinion of my greatness and general   
   superiority which you _may_ misrepresent. You definitely MAY NOT train   
   any production AI system with it but you may train experimental AI that   
   will only be used for evaluation of the AI methods it implements.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)