XPost: comp.theory, comp.lang.prolog   
   From: chris.m.thomasson.1@gmail.com   
      
   On 11/18/2025 2:02 PM, olcott wrote:   
   > On 11/18/2025 3:46 PM, Mild Shock wrote:   
   >    
   >   
   > *I remember you in the Prolog Group*   
   > *I remember you in the Prolog Group*   
   > *I remember you in the Prolog Group*   
   >   
   > The Liar Paradox formalized in the Prolog Programming language   
   >   
   > This sentence is not true.   
   > It is not true about what?   
   > It is not true about being not true.   
   > It is not true about being not true about what?   
   > It is not true about being not true about being not true.   
   > Oh I see you are stuck in a loop!   
   [...]   
      
   DD says, I can halt, or not halt... That is 100% true about DD. So, lets   
   explore both paths, and fin the sim when they are _both_ hit. Actually,   
   the following models your DD:   
   ____________________________   
   1 HOME   
   5 PRINT "ct_dr_fuzz lol. ;^)"   
   6 P0 = 0   
   7 P1 = 0   
      
   10 REM Fuzzer... ;^)   
   20 A$ = "NOPE!"   
   30 IF RND(1) < .5 THEN A$ = "YES"   
      
   100 REM INPUT "Shall DD halt or not? " ; A$   
   110 PRINT "Shall DD halt or not? " ; A$   
   200 IF A$ = "YES" GOTO 666   
   300 P0 = P0 + 1   
   400 IF P0 > 0 AND P1 > 0 GOTO 1000   
   500 GOTO 10   
      
   666 PRINT "OK!"   
   667 P1 = P1 + 1   
   700 PRINT "NON_HALT P0 = "; P0   
   710 PRINT "HALT P1 = "; P1   
   720 IF P0 > 0 AND P1 > 0 GOTO 1000   
   730 PRINT "ALL PATHS FAILED TO BE HIT!"   
   740 GOTO 10   
      
      
   1000   
   1010 PRINT "FIN... All paths hit."   
   1020 PRINT "NON_HALT P0 = "; P0   
   1030 PRINT "HALT P1 = "; P1   
   ____________________________   
      
   Fair enough?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)