1. Forum
  2. FidoNet
  3. comp.lang.python

  • ã-WAM Assembly: Jump and Link for Tseytin Transformation (Re: Blum?s Sp

    From Mild Shock@3:633/10 to All on Friday, August 21, 2026 23:27:23
    Subject: ã-WAM Assembly: Jump and Link for Tseytin Transformation (Re: Blum?s Speed-Up Theorem and Sudoku)

    Hi,

    We can report some progress in the ã-WAM
    compilation using the recently introduced assembly
    with labels. While we already showed disjunction
    (;)/2 without resorting into TRY_ME_ELSE,
    RETRY_ME_ELSE or TRUST_ME. In this take we show how
    to do if-then-else (->)/2 .

    To aid in the compilation of (->)/2 we use the
    front Dogelog VM transform that introduces
    ?$MARK?/1 and ?$CUT?/1. While SWI-Prologs light
    weight choice points store a link address, we
    need also to do the same to call the fresh
    Tseytin proposition. But we do so with
    Jump and Link from RISC.

    Bye

    See also:

    ã-WAM Assembly: Jump and Link for Tseytin Transformation https://medium.com/2989/d81abe7cceb7

    Mild Shock schrieb:
    Hi,

    Years ago Sam Altman said to have no idea how to
    generate revenue, but when the generally intelligent
    system is in place, he might ask it. We take Sudoku
    as the drosophila how different schools deal with
    ?generality?, in this particular instance attacking
    NP problems with constraint solvers.

    Every turing machine T has a turing machine T? that
    can do multiple steps at once. In propagation methods
    repeated goal reconstructions happens, while static
    methods construct goals once. The later is applied in
    Dogelog Player and looking at AI Escargot it can beat
    EyeProlog in the browser.

    Bye

    See also:

    Blum?s Speed-Up Theorem and Sudoku
    https://medium.com/2989/bb8acd0c3284

    Mild Shock schrieb:

    Dear All,

    We are happy to announce a new edition of
    the Dogelog Player:

    - GPU Backend:
    The two pilars of ã-calculus are processes and
    channels. While processes in the CPU Backend
    mapped straight forward to some platform threads
    and a new predicate execute/[1,2]. The predicate
    introduced here is expedite/[1,2] and it does
    the same for your GPU via compute shaders. We
    observed good results with iGPUs from
    budget AI laptops.

    - CPU Channels:
    We mentioned already that the two pilars of
    ã-calculus are processes and channels. In
    search of easy channel objects, we arrived at
    a kind of ADA RendezVous without ACK or NACK.
    This is basically a 1-element mpmc queue, now
    available via the predicate chan/1 for
    the CPU backend.

    - GPU Channels:
    Channel objects are now also available for the
    GPU backend via the predicate flit/1. The approach
    is again some busy-wait, so dont use CPU or GPU
    channels for isolated long waits. Because of a
    batch oriented GPU command API, we could not
    yet provide online communication
    between CPU and GPU .

    Have Fun!

    Jan Burse, August 12, 2026, https://www.herbrand.ai/



    --- PyGate Linux v1.5.19
    * Origin: Dragon's Lair, PyGate NNTP<>Fido Gate (3:633/10)
  • From Mild Shock@3:633/10 to All on Tuesday, August 25, 2026 18:59:45
    Subject: Grothendieck-Group Rewriting in Dogelog Player (Re: ã-WAM Assembly: Jump and Link for Tseytin Transform)

    Hi,

    Since Prologers have their head full of DCG and
    difference lists, using pairs to measure the Earth?s
    circumference. They might also like the idea to use
    difference pairs in rewriting. We attack the
    commutative semiring N[x] where additive inverse
    is missing, Grothendieck-Groups come handy.

    The backtracking of Prolog is perfect to search
    rewrite locations. Following Alexander Grothendieck
    before category theory, a master in generalizing,
    we apply rewriting on equations f = g and not only
    individual terms f and g. The Lawvere example of
    x? = x from x = xý + 1 runs in less than 1 ms.

    Bye

    See also:

    Grothendieck-Group Rewriting in Dogelog Player https://medium.com/2989/51cccc82e3de

    Mild Shock schrieb:
    Hi,

    We can report some progress in the ã-WAM
    compilation using the recently introduced assembly
    with labels. While we already showed disjunction
    (;)/2 without resorting into TRY_ME_ELSE,
    RETRY_ME_ELSE or TRUST_ME. In this take we show how
    to do if-then-else (->)/2 .

    To aid in the compilation of (->)/2 we use the
    front Dogelog VM transform that introduces
    ?$MARK?/1 and ?$CUT?/1. While SWI-Prologs light
    weight choice points store a link address, we
    need also to do the same to call the fresh
    Tseytin proposition. But we do so with
    Jump and Link from RISC.

    Bye

    See also:

    ã-WAM Assembly: Jump and Link for Tseytin Transformation https://medium.com/2989/d81abe7cceb7

    --- PyGate Linux v1.5.19
    * Origin: Dragon's Lair, PyGate NNTP<>Fido Gate (3:633/10)