From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 16/02/2026 11:31, Mikko wrote:   
   > On 15/02/2026 20:08, Tristan Wibberley wrote:   
   >> On 15/02/2026 09:18, Mikko wrote of Olcott:   
   >>   
   >>> That an inifinite sent cannot be in a finite graph may exceed your   
   >>> technical knowledge but certainly doesn't everyone else's.   
   >>   
   >> It can with a paradoxical combinator as a node datum.   
   >   
   > How?   
      
   The so-called "paradoxical combinators" can be used to construct the   
   most famous of their number, the "Y" combinator. That describes looping   
   in a straightforward way so we can know that a DAG which includes a   
   representation of the application of the Y combinator to an applicative   
   object describes a--possibly infinite--loop.   
      
   That is very uncontroversial, standard knowledge in combinatory logic   
   and lambda analysis since before the second world war, and common in   
   pure functional computer programming hobby activities today.   
      
   --   
   Tristan Wibberley   
      
   The message body is Copyright (C) 2026 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)