From: NoOne@nospicedham.NoWhere.com   
      
   On 9/3/2020 9:22 AM, George Neuner wrote:   
   > On Sun, 30 Aug 2020 13:40:20 -0500, olcott   
   >  wrote:   
   >   
   >> The end goal of this sequence of posts is to show that the basic "C"   
   >> programming language (without the "C" libraries) can be fully mapped to   
   >> an abstract model of computation that is equivalent to a Turing machine   
   >> in such a way that any Turing complete computation can be written in the   
   >> "C" programming language.   
   >>      :   
   >   
   >   
   > It's already well known that C is Turing complete.   
   >   
      
   It is well known that "C" is Turing complete except for its lack of   
   unlimited memory.   
      
   I needed to show that concrete C/x86 computations on physical hardware   
   are equivalent to corresponding computations on a Turing Machine.   
      
   This may be a new concept:   
   Computational equivalence means that two machines will always produce   
   equivalent output for equivalent input or fail to halt on equivalent input.   
      
   I need this to show the relevance of my x86 based Universal Turing   
   Machine equivalent. This machine has the x86 language as its machine   
   description language and can execute a UTM that executes another UTM in   
   debug step mode. It can do this to an arbirary recursive depth.   
      
   --   
   Copyright 2020 Pete Olcott   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)