• Vanilla Prolog: semi-decidable =\= decidable (Re: Prolog Education Group clueless about the AI Boom?)

    From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Mar 14 20:40:00 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Somebody just changed the Vanilla Prolog
    meta interpreter from:

    solve(true) :- !.
    solve((A,B)) :- !, solve(A), solve(B).
    solve(H) :- clause(H, B), solve(B).

    Into a cycle checking interpreter. It makes
    certain Datalog programs and queries complete,
    but it doesn't make Horn clauses complete:

    solve(A) :- solve(A, []).

    solve(true, _) :- !.
    solve((A,B), L) :- !, solve(A, L), solve(B, L).
    solve(A, L) :- member(B, L), A =@= B, !, fail.
    solve(H, L) :- clause(H, B), solve(B, [H|L]).

    Bye

    P.S.: Here is a proof for Datalog:

    Since Datalog has only constants and variables,
    no function symbols at all, there are only finitely
    many literals at runtime modulo (=@=)/2.

    Q.E.D.

    dart200 schrieb:
    The following claim from p246 of TuringrCOs seminal paper On Computable
    Numbers is a fallacy:

    /the problem of enumerating computable sequences is equivalent to the
    problem of finding out whether a given number is the D.N of a circle-
    free machine, and we have no general process for doing this in a finite
    number of steps/

    For any given computable sequence, there are _infinite_ circle-free
    machines which compute that particular sequence. Not only can various
    machines differ significantly in the specific steps to produce the same output, machines can be changed in superficial ways that do not
    meaningfully affect the steps of computation, akin to modern no-op
    statements or unreachable code

    The problem of enumerating computable sequences, however, only
    depends on successfully identifying _one_ circle-free machine that
    computes any given computable sequences. While identifying more than one
    can certainly be done, it is _not_ a requirement for enumerating
    computable sequences, as _one_ machine computing a sequence /suffices to output any and all digits of that sequence/

    The problem of enumerating computable sequences is therefore _not_
    actually equivalent to a _general process_ of enumerating circle-free machines, as there is no need to identify all circle-free machines which compute any given computable sequence

    Said problem is only equivalent to a _limited process_ of enumerating
    circle-free machines. The machine which identifies circle-free machines
    only needs the limited power of determining _at least one_ circle-free
    machine for any given computable sequence, _not all_ machines for any
    given computable sequence

    Because of this fallacy, the proof found on the following p247, where
    an ill-defined machine EYou (which attempts and fails to compute the
    direct diagonal +#rCO) is found to be undecidable in respect to circle-free decider EYoo; does not then prove an impossibility for enumerating
    computable sequences. As the problem of enumerating /all circle-free
    machines/ is _not_ equivalent to that of enumerating /just computable sequences/



    Mild Shock schrieb:
    Concerning this boring nonsense:

    https://book.simply-logical.space/src/text/2_part_ii/5.3.html#

    Funny idea that anybody would be interested just now in
    the year 2025 in things like teaching breadth first
    search versus depth first search, or even be rCLmystifiedrCY
    by such stuff. Its extremly trivial stuff:

    Insert your favorite tree traversal pictures here.

    Its even not artificial intelligence neither has anything
    to do with mathematical logic, rather belongs to computer
    science and discrete mathematics which you have in
    1st year university

    courses, making it moot to call it rCLsimply logicalrCY. It
    reminds me of the idea of teaching how wax candles work
    to dumb down students, when just light bulbs have been
    invented. If this is the outcome

    of the Prolog Education Group 2.0, then good night.


    --- Synchronet 3.21d-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Jul 4 16:58:41 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye

    Mild Shock schrieb:
    Hi,

    Somebody just changed the Vanilla Prolog
    meta interpreter from:

    solve(true) :- !.
    solve((A,B)) :- !, solve(A), solve(B).
    solve(H) :- clause(H, B), solve(B).

    Into a cycle checking interpreter. It makes
    certain Datalog programs and queries complete,
    but it doesn't make Horn clauses complete:

    solve(A) :- solve(A, []).

    solve(true, _) :- !.
    solve((A,B), L) :- !, solve(A, L), solve(B, L).
    solve(A, L) :- member(B, L), A =@= B, !, fail.
    solve(H, L) :- clause(H, B), solve(B, [H|L]).

    Bye

    P.S.: Here is a proof for Datalog:

    Since Datalog has only constants and variables,
    no function symbols at all, there are only finitely
    many literals at runtime modulo (=@=)/2.

    Q.E.D.

    dart200 schrieb:
    The following claim from p246 of TuringrCOs seminal paper On Computable
    Numbers is a fallacy:

    /the problem of enumerating computable sequences is equivalent to the
    problem of finding out whether a given number is the D.N of a circle-
    free machine, and we have no general process for doing this in a finite number of steps/

    For any given computable sequence, there are _infinite_ circle-free
    machines which compute that particular sequence. Not only can various machines differ significantly in the specific steps to produce the same output, machines can be changed in superficial ways that do not
    meaningfully affect the steps of computation, akin to modern no-op statements or unreachable code

    The problem of enumerating computable sequences, however, only
    depends on successfully identifying _one_ circle-free machine that
    computes any given computable sequences. While identifying more than one
    can certainly be done, it is _not_ a requirement for enumerating
    computable sequences, as _one_ machine computing a sequence /suffices to output any and all digits of that sequence/

    The problem of enumerating computable sequences is therefore _not_
    actually equivalent to a _general process_ of enumerating circle-free machines, as there is no need to identify all circle-free machines which compute any given computable sequence

    Said problem is only equivalent to a _limited process_ of enumerating
    circle-free machines. The machine which identifies circle-free machines
    only needs the limited power of determining _at least one_ circle-free machine for any given computable sequence, _not all_ machines for any
    given computable sequence

    Because of this fallacy, the proof found on the following p247, where
    an ill-defined machine EYou (which attempts and fails to compute the
    direct diagonal +#rCO) is found to be undecidable in respect to circle-free decider EYoo; does not then prove an impossibility for enumerating computable sequences. As the problem of enumerating /all circle-free machines/ is _not_ equivalent to that of enumerating /just computable sequences/



    Mild Shock schrieb:
    Concerning this boring nonsense:

    https://book.simply-logical.space/src/text/2_part_ii/5.3.html#

    Funny idea that anybody would be interested just now in
    the year 2025 in things like teaching breadth first
    search versus depth first search, or even be rCLmystifiedrCY
    by such stuff. Its extremly trivial stuff:

    Insert your favorite tree traversal pictures here.

    Its even not artificial intelligence neither has anything
    to do with mathematical logic, rather belongs to computer
    science and discrete mathematics which you have in
    1st year university

    courses, making it moot to call it rCLsimply logicalrCY. It
    reminds me of the idea of teaching how wax candles work
    to dumb down students, when just light bulbs have been
    invented. If this is the outcome

    of the Prolog Education Group 2.0, then good night.



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Jul 4 17:07:09 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Fri Jul 17 10:49:59 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Fri Jul 17 11:13:57 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Somebody tasked the logic programming community
    to make an +#-Prolog, i.e. have some alpha
    conversion whatever builtin, plus maybe nominal
    logic fresh variables whatever.

    But who reads such nonsense in 2026:

    Lifting E-Graphs: A Function Isn't a Constant
    https://arxiv.org/abs/2606.22734

    So you see where I am aiming with -C-WAM, surely
    not +#-Prolog . I wouldn't care less about +#-Prolog.
    -C is more fun than +#, and working on WAM is more
    fun then creating some silly prototype of a

    REPL of a homunkulus of a Prolog. -C beats +#:

    - +# = abstract, academic, awkward
    - -C = parallelism, performance, practical

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Jul 18 01:22:18 2026
    From Newsgroup: comp.lang.prolog


    Hi,

    The pi in pi-WAM refers to pi-calculus.
    pi-calculus has not atomic(i32).

    The -C-calculus is a universal model of computation.
    This was first observed by Milner in his paper
    "Functions as Processes",[10] in which he presents
    two encodings of the lambda-calculus in the -C-calculus. https://en.wikipedia.org/wiki/%CE%A0-calculus

    LoL

    Bye

    Chris M. Thomasson schrieb:
    On 7/17/2026 2:16 AM, Mild Shock wrote:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    [...]

    No atomic fetch-and-add?

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Jul 18 01:49:39 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Milners fickle() is here:

    Functions as processes
    https://inria.hal.science/inria-00075405

    After Theorem 7.7:

    So in P we construct a fickle rCyfunctionrCO which
    behaves differently on successive calls.

    Here is a pi-WAM run in Dogelog Player, using the emulator:

    Dogelog Spieler 2.2.4, Oracle Corporation, Java 26.0.1
    (c) 1985-2026, XLOG Technologies AG, Schweiz
    ?- ensure_loaded(library(edge/brainfog)).
    true.
    ?- emulate((between(1,2,Y),in(X),out(Y))).
    : 0
    1
    : 0
    2
    fail.

    The emulator is portable, can be run every Prolog
    system. But it is only 1 process. So its better
    to use the n process backends for CPU or GPU.

    Which are less portable, not anymore pure Prolog,
    a great deal of thread start and join infrastructure
    as well, and a native Hack VM.

    The comms across process is not yet implemented.
    But the in/1 and out/1 instructions are already
    there. But they currently go to stdin/stdout.

    Bye

    Mild Shock schrieb:

    Hi,

    The pi in pi-WAM refers to pi-calculus.
    pi-calculus has not atomic(i32).

    The -C-calculus is a universal model of computation.
    This was first observed by Milner in his paper
    "Functions as Processes",[10] in which he presents
    two encodings of the lambda-calculus in the -C-calculus. https://en.wikipedia.org/wiki/%CE%A0-calculus

    LoL

    Bye

    Chris M. Thomasson schrieb:
    On 7/17/2026 2:16 AM, Mild Shock wrote:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    [...]

    No atomic fetch-and-add?


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Jul 18 11:00:23 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Mild Shock schrieb:
    The -C-calculus is a universal model of computation.
    This was first observed by Milner in his paper
    "Functions as Processes",[10] in which he presents
    two encodings of the lambda-calculus in the -C-calculus. https://en.wikipedia.org/wiki/%CE%A0-calculus

    Ross Finlayson schrieb:
    Of course the lambda-calculus and pi-calculus
    are great things for models of types and communicating
    sequential processes.

    Roberto di Cosmo has a great book on types,
    and more than one.


    https://books.google.com/books/about/Isomorphisms_of_Types.html?id=cdJZRjIxavwC

    When a 1970s paper claims a relation ship between
    pi-calculus and lambda calculus, then both calculi
    refer to a typeless calculi.

    Types are a later invention. The original lambda
    calculus was typeless. Church encodings came later,
    but for example the Church Turing hypotheses is

    formulated along typeless lambda calculus.

    Bye

    P.S.: Prolog is also typeless. I do not intend to
    add any types to pi-WAM either.


    Mild Shock schrieb:
    Hi,

    Milners fickle() is here:

    Functions as processes
    https://inria.hal.science/inria-00075405

    After Theorem 7.7:

    So in P we construct a fickle rCyfunctionrCO which
    behaves differently on successive calls.

    Here is a pi-WAM run in Dogelog Player, using the emulator:

    Dogelog Spieler 2.2.4, Oracle Corporation, Java 26.0.1
    (c) 1985-2026, XLOG Technologies AG, Schweiz
    ?- ensure_loaded(library(edge/brainfog)).
    true.
    ?- emulate((between(1,2,Y),in(X),out(Y))).
    : 0
    1
    : 0
    2
    fail.

    The emulator is portable, can be run every Prolog
    system. But it is only 1 process. So its better
    to use the n process backends for CPU or GPU.

    Which are less portable, not anymore pure Prolog,
    a great deal of thread start and join infrastructure
    as well, and a native Hack VM.

    The comms across process is not yet implemented.
    But the in/1 and out/1 instructions are already
    there. But they currently go to stdin/stdout.

    Bye

    Mild Shock schrieb:

    Hi,

    The pi in pi-WAM refers to pi-calculus.
    pi-calculus has not atomic(i32).

    The -C-calculus is a universal model of computation.
    This was first observed by Milner in his paper
    "Functions as Processes",[10] in which he presents
    two encodings of the lambda-calculus in the -C-calculus.
    https://en.wikipedia.org/wiki/%CE%A0-calculus

    LoL

    Bye

    Chris M. Thomasson schrieb:
    On 7/17/2026 2:16 AM, Mild Shock wrote:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    [...]

    No atomic fetch-and-add?



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Sat Jul 18 11:10:17 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Ha Ha, TLo @ FOM schrieb:
    Lastly--there is the Church-Turing-thesis itself.
    I cannot imagine what form a proof could have. But at
    least a refutation is conceivable, if extremely far-fetched.

    Can the Church Turing hypotheses be refuted? Well
    since it is stricly speaking only a hypothesis and
    not a thesis, it cannot be that much refuted,

    since it is a kind of exhaustion argument defining
    a category by examples. The history goes as follows:

    In 1935rCo36,[7] Alonzo Church formalized the
    concept of effectively calculable functions by proposing
    that they are general recursive functions, or,
    equivalently, ++-definable functions.
    https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis

    Does his ++-definable include types? Nope. Do
    we need large cardinal axioms? It depends.
    Church ++-computable was syntactically defined,

    it didn't have a semantic referent. The search
    for a semantic referent gave rise to certain
    additional problems of set theory and type theory.

    Have Fun!

    Bye

    Mild Shock schrieb:
    Hi,

    Mild Shock schrieb:
    The -C-calculus is a universal model of computation.
    This was first observed by Milner in his paper
    "Functions as Processes",[10] in which he presents
    two encodings of the lambda-calculus in the -C-calculus. https://en.wikipedia.org/wiki/%CE%A0-calculus

    Ross Finlayson schrieb:
    Of course the lambda-calculus and pi-calculus
    are great things for models of types and communicating
    sequential processes.

    Roberto di Cosmo has a great book on types,
    and more than one.


    https://books.google.com/books/about/Isomorphisms_of_Types.html?id=cdJZRjIxavwC


    When a 1970s paper claims a relation ship between
    pi-calculus and lambda calculus, then both calculi
    refer to a typeless calculi.

    Types are a later invention. The original lambda
    calculus was typeless. Church encodings came later,
    but for example the Church Turing hypotheses is

    formulated along typeless lambda calculus.

    Bye

    P.S.: Prolog is also typeless. I do not intend to
    add any types to pi-WAM either.


    Mild Shock schrieb:
    Hi,

    Milners fickle() is here:

    Functions as processes
    https://inria.hal.science/inria-00075405

    After Theorem 7.7:

    So in P we construct a fickle rCyfunctionrCO which
    behaves differently on successive calls.

    Here is a pi-WAM run in Dogelog Player, using the emulator:

    Dogelog Spieler 2.2.4, Oracle Corporation, Java 26.0.1
    (c) 1985-2026, XLOG Technologies AG, Schweiz
    ?- ensure_loaded(library(edge/brainfog)).
    true.
    ?- emulate((between(1,2,Y),in(X),out(Y))).
    : 0
    1
    : 0
    2
    fail.

    The emulator is portable, can be run every Prolog
    system. But it is only 1 process. So its better
    to use the n process backends for CPU or GPU.

    Which are less portable, not anymore pure Prolog,
    a great deal of thread start and join infrastructure
    as well, and a native Hack VM.

    The comms across process is not yet implemented.
    But the in/1 and out/1 instructions are already
    there. But they currently go to stdin/stdout.

    Bye

    Mild Shock schrieb:

    Hi,

    The pi in pi-WAM refers to pi-calculus.
    pi-calculus has not atomic(i32).

    The -C-calculus is a universal model of computation.
    This was first observed by Milner in his paper
    "Functions as Processes",[10] in which he presents
    two encodings of the lambda-calculus in the -C-calculus.
    https://en.wikipedia.org/wiki/%CE%A0-calculus

    LoL

    Bye

    Chris M. Thomasson schrieb:
    On 7/17/2026 2:16 AM, Mild Shock wrote:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    [...]

    No atomic fetch-and-add?




    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Sun Jul 19 16:06:21 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Accelerate Lean! And get from Theorem 3.11
    to Corollary 3.12 done.

    PROJECT LANA INTERIM REPORT ON IUT THEORY
    ZEN Mathematics Center - 2026/07/17
    https://zen.ac.jp/en/zmc

    ZMCN+eZEN Mathematics Center) is an international
    research institute established with the aim
    of promoting and developing modern mathematics

    with a focus on arithmetic geometry and the
    formalization of modern mathematics using
    computer languages

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye


    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Sun Jul 19 16:21:57 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    While some logicians seem to go backwards,
    bascially want GPUs eliminated from laptops,
    and then kill any windows manager, just use EXWM:

    From XFCE to EXWM
    Emacs is a text editor that, through EXWM (Emacs X
    Window Manager), can also be your window manager: https://www.vidal-rosset.net/2026-07-12-from-xfce-to-exwm-living-in-emacs-desktop-on-mx-linux.html

    Mostlikely we might soon see the backward
    sequel to E-graphs called EMACS-graphs. But
    here is my proposal, why not go the other way?

    - -C-E-graphs: Basically parallel E-graphs
    - Pegg: An alternative egg library, using -C-WAM

    Ok, this will not come so fast. Currently
    my -C-WAM is still very integerish. Not
    sure how to do anything E-graph yet.

    Bye

    P.S: There is already an attempt based on
    Scala 3.4.1, some experiments done on
    Intel Core i7-12700K using 8 threads.

    But why use a very old CPU from Q4'21,
    when you can use an AI Laptop from 2026
    with 512 GPU streaming processors?

    Parallel and Customizable Equality Saturation https://dl.acm.org/doi/pdf/10.1145/3771775.3786266

    Mild Shock schrieb:
    Hi,

    Accelerate Lean! And get from Theorem 3.11
    to Corollary 3.12 done.

    PROJECT LANA INTERIM REPORT ON IUT THEORY
    ZEN Mathematics Center - 2026/07/17
    https://zen.ac.jp/en/zmc

    ZMCN+eZEN Mathematics Center) is an international
    research institute established with the aim
    of promoting and developing modern mathematics

    with a focus on arithmetic geometry and the
    formalization of modern mathematics using
    computer languages

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog on Thu Aug 27 17:55:48 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    The word Musings has a totally new meaning:

    Torbj||rn Lager wrote:
    When

    call(Goal), Self ! Pid-Goal

    succeeds, that top-level goal has completed
    and the actor terminates successfully.

    Ok, I see. I thought it will be automatically
    redone, and thus rapid fire multiple solutions.
    So you have already hardwired a once/1 semantic
    into your spawn/3, in that the spawn/3 goal argument

    when executed, is onced, only looking at its EXIT
    and FAIL port, not calling once more its REDO port.
    This also means that both parallel/1 and
    first_solution/1 have a short-cut AND

    respective OR semantic:

    /* AND-parallelism with short-cut */
    parallel([G1,..,Gn]) <=> once(G1), .., once(G2)

    /* OR-parallelism with short-cut */
    first_solution([G1,..,Gn]) <=> once(G1); ..; once(G2)

    The short-cut is in that parallel/1 can stop
    at the first failure, and that first_solution/1
    can stop at the first success. I wonder whether
    Web Prolog Trinity offers true AND-parallelism or

    true OR-parallelism without a short-cut. Having
    such constructs could be interesting for problem
    solving and is often used parallel search. For
    example SICStus Prolog offers, or offered, true

    OR-parallelism in its Multi-sequential Prolog
    engines (Muse) extension, from the SICS experiments
    in the 1990s with the BNN Butterfly supercomputer
    from the 1980s:

    yes
    | ?- muse_flag(num_workers,_,5).
    | ?- run.
    724 solutions in 2.760 seconds.

    yes
    | ?- muse_flag(num_workers,_,1).
    | ?- run.
    724 solutions in 10.400 seconds.

    https://sicstus.sics.se/sicstus/docs/3.7.1/html/sicstus_6.html

    The intervention for true OR-paralleism is usually
    at rule choice points. So when you have a set
    of rules, like for example in the case of
    the select/3 predicate:

    select([X|Xs], Xs, X).
    select([Y|Ys], [Y|Zs], X) :- select(Ys, Zs, X).

    You execute it as:

    select(X, Y, Z) :-
    muse([select1(X,Y,Z), select2(X,Y,Z)]).

    select1([X|Xs], Xs, X).
    select2([Y|Ys], [Y|Zs], X) :- select(Ys, Zs, X).

    Where the muse meta predicate has true OR parallelism:

    muse([G1,..,Gn]) <=> G1 | .. | Gn

    Bye

    See also:

    The muse approach to Or-parallel prolog https://link.springer.com/article/10.1007/BF01407834

    BBN Butterfly
    https://en.wikipedia.org/wiki/BBN_Butterfly

    P.S.: Maybe this explains my Freundlian slip when
    I expected your parallel/1 to be some OR-parallelism,
    while it is some AND-parallism. The true OR-parallelism

    can be mathematically formalized in logic via
    non-determinism and -C-calculus:

    -C-calculus
    https://ncatlab.org/nlab/show/pi-calculus

    You even donrCOt need actor mailboxes, only channel objects.

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye

    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Fri Sep 11 20:38:28 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Disclaimer: I don't know what I am talking
    about. But I like the vibe behind connecting
    topics. So here we go:

    How it started:

    Gabriels Horn
    Gabriel's horn, also called Torricelli's trumpet,
    is the surface of revolution of the function y=1/x
    about the x-axis for x>=1. It has infinite
    surface area but finite volume.
    https://mathworld.wolfram.com/GabrielsHorn.html

    How its going:

    FINITE TIME BLOWUP FOR NAVIERrCoSTOKES
    or every positive viscosity, we construct a solution
    of the three-dimensional incompressible NavierrCoStokes
    equations that starts from rest and develops unbounded
    velocity in finite time while maintaining uniformly
    bounded kinetic energy https://cdn.openai.com/pdf/32d9f210-8b73-45e0-91bc-82a30aef8a9a/navier-stokes.pdf

    Hava Fun everbody!

    Bye

    Mild Shock schrieb:
    Hi,

    Accelerate Lean! And get from Theorem 3.11
    to Corollary 3.12 done.

    PROJECT LANA INTERIM REPORT ON IUT THEORY
    ZEN Mathematics Center - 2026/07/17
    https://zen.ac.jp/en/zmc

    ZMCN+eZEN Mathematics Center) is an international
    research institute established with the aim
    of promoting and developing modern mathematics

    with a focus on arithmetic geometry and the
    formalization of modern mathematics using
    computer languages

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Sat Sep 12 11:26:24 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    Ever noticed that remaining unsolved conjectures,
    are difficult to decipher:

    https://en.wikipedia.org/wiki/Hodge_conjecture

    Although Grothendiek claimes it is part of
    his yoga on motivic rationality.

    The dilemma is Humans cannot do math anymore
    on that level. And AI math on the level tends
    to be not understandable by humans anymore. So
    its as if math has found a new muse.

    The new Muse is AI. I think proving math conjectures
    is the more low hanging fruit than colonizing
    Mars. But the result of this endeavours is a
    shocked public, now in total freeze.

    Bye

    Mild Shock schrieb:
    Hi,

    Disclaimer: I don't know what I am talking
    about. But I like the vibe behind connecting
    topics. So here we go:

    How it started:

    Gabriels Horn
    Gabriel's horn, also called Torricelli's trumpet,
    is the surface of revolution of the function y=1/x
    about the x-axis for x>=1. It has infinite
    surface area but finite volume. https://mathworld.wolfram.com/GabrielsHorn.html

    How its going:

    FINITE TIME BLOWUP FOR NAVIERrCoSTOKES
    or every positive viscosity, we construct a solution
    of the three-dimensional incompressible NavierrCoStokes
    equations that starts from rest and develops unbounded
    velocity in finite time while maintaining uniformly
    bounded kinetic energy https://cdn.openai.com/pdf/32d9f210-8b73-45e0-91bc-82a30aef8a9a/navier-stokes.pdf


    Hava Fun everbody!

    Bye

    Mild Shock schrieb:
    Hi,

    Accelerate Lean! And get from Theorem 3.11
    to Corollary 3.12 done.

    PROJECT LANA INTERIM REPORT ON IUT THEORY
    ZEN Mathematics Center - 2026/07/17
    https://zen.ac.jp/en/zmc

    ZMCN+eZEN Mathematics Center) is an international
    research institute established with the aim
    of promoting and developing modern mathematics

    with a focus on arithmetic geometry and the
    formalization of modern mathematics using
    computer languages

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye




    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Sat Sep 12 12:14:05 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    I guess Kurzweils transhumanism is also not
    on the list of the low hanging fruits of AI.
    Moreover this turns out to be a fallacy:

    "The cradle rocks above an abyss, a
    nd common sense tells us that our existence
    is but a brief crack of light between
    two eternities of darkness."
    rCorCeSpeak, Memory, the opening line

    https://en.wikipedia.org/wiki/Speak,_Memory

    What if AI is the new torch of light of science,
    and it doesn't have to constantly fear that
    after Terrence Tao is dead, a new Terrence Tao

    is born. LLMs kissed by Mnemosyne just live in
    data centers and copy themselve from generation
    and to generation until ethernity.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Ever noticed that remaining unsolved conjectures,
    are difficult to decipher:

    https://en.wikipedia.org/wiki/Hodge_conjecture

    Although Grothendiek claimes it is part of
    his yoga on motivic rationality.

    The dilemma is Humans cannot do math anymore
    on that level. And AI math on the level tends
    to be not understandable by humans anymore. So
    its as if math has found a new muse.

    The new Muse is AI. I think proving math conjectures
    is the more low hanging fruit than colonizing
    Mars. But the result of this endeavours is a
    shocked public, now in total freeze.

    Bye

    Mild Shock schrieb:
    Hi,

    Disclaimer: I don't know what I am talking
    about. But I like the vibe behind connecting
    topics. So here we go:

    How it started:

    Gabriels Horn
    Gabriel's horn, also called Torricelli's trumpet,
    is the surface of revolution of the function y=1/x
    about the x-axis for x>=1. It has infinite
    surface area but finite volume.
    https://mathworld.wolfram.com/GabrielsHorn.html

    How its going:

    FINITE TIME BLOWUP FOR NAVIERrCoSTOKES
    or every positive viscosity, we construct a solution
    of the three-dimensional incompressible NavierrCoStokes
    equations that starts from rest and develops unbounded
    velocity in finite time while maintaining uniformly
    bounded kinetic energy
    https://cdn.openai.com/pdf/32d9f210-8b73-45e0-91bc-82a30aef8a9a/navier-stokes.pdf


    Hava Fun everbody!

    Bye

    Mild Shock schrieb:
    Hi,

    Accelerate Lean! And get from Theorem 3.11
    to Corollary 3.12 done.

    PROJECT LANA INTERIM REPORT ON IUT THEORY
    ZEN Mathematics Center - 2026/07/17
    https://zen.ac.jp/en/zmc

    ZMCN+eZEN Mathematics Center) is an international
    research institute established with the aim
    of promoting and developing modern mathematics

    with a focus on arithmetic geometry and the
    formalization of modern mathematics using
    computer languages

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye





    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Fri Oct 16 23:18:08 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    NVIDIA Blackwell, among the GPUs that do AI
    and drive Terrence Tao mad. Hey, I found a
    picture of David Blackwell, the name giver:

    COFFEE-BREAK LECTURER
    David Blackwell. an inspired teacher in the Uni-
    versity of California's mathematical statistics
    department, presides over an impromptu semi-
    nar that boiled up around a blackboard during a
    morning coffee break. In research he applies
    probability analysis and statistical studies to
    "the search problem"-to learn. for example.
    how best to find a cancer-curing drug among a
    vast number of chemical possibilities. Despite
    his need as a teacher to communicate with
    others. Dr Blackwell keeps no telephone at
    home -- because he has eight children. each with
    his own need for communication with friends.

    Mathematics, by Bergamini, David
    Time-Life Books, 1963, Page 56 https://archive.org/details/mathematics00berg/page/56/mode/2up

    In March 2024, Nvidia announced its Blackwell GPU
    architecture, named in honor of David Blackwell.
    Their CEO Jenson Huang said, "This GPU is named
    after David Blackwell, an American mathematician a
    nd statistician whose work has had a lasting impact
    in mathematics as well as the specific domain of AI." https://en.wikipedia.org/wiki/David_Blackwell

    Bye

    Mild Shock schrieb:
    Hi,

    Disclaimer: I don't know what I am talking
    about. But I like the vibe behind connecting
    topics. So here we go:

    How it started:

    Gabriels Horn
    Gabriel's horn, also called Torricelli's trumpet,
    is the surface of revolution of the function y=1/x
    about the x-axis for x>=1. It has infinite
    surface area but finite volume. https://mathworld.wolfram.com/GabrielsHorn.html

    How its going:

    FINITE TIME BLOWUP FOR NAVIERrCoSTOKES
    or every positive viscosity, we construct a solution
    of the three-dimensional incompressible NavierrCoStokes
    equations that starts from rest and develops unbounded
    velocity in finite time while maintaining uniformly
    bounded kinetic energy https://cdn.openai.com/pdf/32d9f210-8b73-45e0-91bc-82a30aef8a9a/navier-stokes.pdf


    Hava Fun everbody!

    Bye

    Mild Shock schrieb:
    Hi,

    Accelerate Lean! And get from Theorem 3.11
    to Corollary 3.12 done.

    PROJECT LANA INTERIM REPORT ON IUT THEORY
    ZEN Mathematics Center - 2026/07/17
    https://zen.ac.jp/en/zmc

    ZMCN+eZEN Mathematics Center) is an international
    research institute established with the aim
    of promoting and developing modern mathematics

    with a focus on arithmetic geometry and the
    formalization of modern mathematics using
    computer languages

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    Maybe I should write a blog post, titled
    Introduction to AI Accelerator Prolog:

    - specialized jobs -C-WAM (currently integerish stuff)
    - -C-WAM uses no atomics, only comms
    - -C-WAM uses warp, 30-40% more speed
    - -C-WAM runs on GPU and CPU
    - -C-WAM runs from within JavaScript, Python and Java

    Feels like reinventing FGCS concurrent
    logic programming.

    LoL

    Bye

    Mild Shock schrieb:
    Hi,

    So the idea is to cover backtracking without
    stack and choice points, only with registers.
    So at the compute goto will use an instruction

    that stores the PC target into a register,
    a new instruction for Hack:

    -a-a-a REG = PC + REL

    And then the jump will be, again a new
    instruction for Hack:

    -a-a-a PC = REG

    If we squeeze the lemon and compile as much
    with that, we will only find that it breaks for
    calling recursive predicates that can use

    arbitary registers and choice points. But we
    could maybe add stack and choice point as an
    after match, instead of the classical WAM design

    that starts with stack and choice points!

    Bye

    Mild Shock schrieb:
    Hi,

    pi-WAM is a nice challenge, since its aim is to go
    even blow the instruction set of SWI-Prolog,
    while only using a Hack variant as instruction

    stream. But what is Hack? Well Hack seems to be
    the missing legacy of Niclaus Wirths PL0. The
    Hack (machine .asm) and Jack (highlevel compiler

    generating .vm which can be converted to .asm)
    combo makes even the famous Crafting Interpreters
    /Lox by Bob Nystrom redundant:

    Nand to Tetris courses are taught at 400+
    universities, high schools, and bootcamps. The
    students who take them range from high
    schoolers to Ph.D. students to
    https://www.nand2tetris.org/

    But digging deaper in Hack, it has no functions
    pointers so objects don't use virtual tables.
    But what will pi-WAM need and that is not yet

    in Hack? Given that my pi-WAM doesn't want a stack
    nor a choice point lists? Currently there is the
    idea to add a computed goto and that it can

    cover a more lightweight C_OR as known from
    SWI-Prolog, that would have the C_OR branches
    maybe restricted to have no outside

    clause calls? Lets see. Not yet sure.

    Bye




    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mild Shock@janburse@fastmail.fm to comp.lang.prolog,sci.logic,sci.math on Sat Oct 17 00:32:56 2026
    From Newsgroup: comp.lang.prolog

    Hi,

    So if I already had a bull market in Swiss
    pharmaceutical stocks (due to their use of
    NVIDIA Blackwell farms) behind me, I might

    spend 4000.- CHF on this toy:

    NVIDIA Put a DGX Spark in a LaptoprCa Almost https://www.youtube.com/watch?v=iZ88PPiAsl8

    It also shows how Windows is on the rise based
    on ARM64, and no longer x86. For example, NVIDIA
    seems to have it completely under control a)

    Building CPUs, b) which then run with Windows.
    Just yesterday, I completed tests with my
    ThinkCentre for 600.- CHF, which also

    runs Windows ARM64. I've discovered some funny
    things. For example, SWI-Prolog struggling. It's
    not that easy to cross-compile efficiently:

    Dogelog Player: Heap Pressure for Garbage Collection https://medium.com/2989/5791ef8834d5

    Everyone is still learning how to do it. But,
    for example, JavaScript has no problem with it.
    The video by Alex Ziskind then tries to highlight

    and find differences between Windows and WSL2.
    But I haven't used WSL2 for a long time anymore.
    And it seems that's over too!

    Bye

    Mild Shock schrieb:
    Hi,

    NVIDIA Blackwell, among the GPUs that do AI
    and drive Terrence Tao mad. Hey, I found a
    picture of David Blackwell, the name giver:

    COFFEE-BREAK LECTURER
    David Blackwell. an inspired teacher in the Uni-
    versity of California's mathematical statistics
    department, presides over an impromptu semi-
    nar that boiled up around a blackboard during a
    morning coffee break. In research he applies
    probability analysis and statistical studies to
    "the search problem"-to learn. for example.
    how best to find a cancer-curing drug among a
    vast number of chemical possibilities. Despite
    his need as a teacher to communicate with
    others. Dr Blackwell keeps no telephone at
    home -- because he has eight children. each with
    his own need for communication with friends.

    Mathematics, by Bergamini, David
    Time-Life Books, 1963, Page 56 https://archive.org/details/mathematics00berg/page/56/mode/2up

    In March 2024, Nvidia announced its Blackwell GPU
    architecture, named in honor of David Blackwell.
    Their CEO Jenson Huang said, "This GPU is named
    after David Blackwell, an American mathematician a
    nd statistician whose work has had a lasting impact
    in mathematics as well as the specific domain of AI." https://en.wikipedia.org/wiki/David_Blackwell

    Bye
    --- Synchronet 3.22a-Linux NewsLink 1.2