From: mikko.levanto@iki.fi   
      
   On 17/02/2026 00:59, Tristan Wibberley wrote:   
   > 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.   
      
   How is there an infinite set in that DAG ?   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)