Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #646834 > unrolled thread
| Started by | Mild Shock <janburse@fastmail.fm> |
|---|---|
| First post | 2026-07-19 16:06 +0200 |
| Last post | 2026-09-12 12:14 +0200 |
| Articles | 5 — 1 participant |
Back to article view | Back to sci.math
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC] (Was: Introduction to AI Accelerator Prolog [π-WAM of Dogelog]) Mild Shock <janburse@fastmail.fm> - 2026-07-19 16:06 +0200
ANN: Library Pegg, for π-E-graphs [Not EXWM] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) Mild Shock <janburse@fastmail.fm> - 2026-07-19 16:21 +0200
Harmonic Analysis collides with Gabriels Horn [9-11 Math Incident] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) Mild Shock <janburse@fastmail.fm> - 2026-09-11 20:38 +0200
Math has found a new Muse [Grothendieck Hodges] (Was: Harmonic Analysis collides with Gabriels Horn) Mild Shock <janburse@fastmail.fm> - 2026-09-12 11:26 +0200
Kurzweils prognostic failure [Nabokov Fallacy] (Re: Math has found a new Muse [Grothendieck Hodges]) Mild Shock <janburse@fastmail.fm> - 2026-09-12 12:14 +0200
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2026-07-19 16:06 +0200 |
| Subject | Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC] (Was: Introduction to AI Accelerator Prolog [π-WAM of Dogelog]) |
| Message-ID | <113ilkt$2ouu$1@solani.org> |
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 ZMC（ZEN 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 π-WAM (currently integerish stuff) > - π-WAM uses no atomics, only comms > - π-WAM uses warp, 30-40% more speed > - π-WAM runs on GPU and CPU > - π-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: >> >> 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 >
[toc] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2026-07-19 16:21 +0200 |
| Subject | ANN: Library Pegg, for π-E-graphs [Not EXWM] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) |
| Message-ID | <113imi5$2pqt$1@solani.org> |
| In reply to | #646834 |
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? - π-E-graphs: Basically parallel E-graphs - Pegg: An alternative egg library, using π-WAM Ok, this will not come so fast. Currently my π-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 > > ZMC（ZEN 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 π-WAM (currently integerish stuff) >> - π-WAM uses no atomics, only comms >> - π-WAM uses warp, 30-40% more speed >> - π-WAM runs on GPU and CPU >> - π-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: >>> >>> 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 >> >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2026-09-11 20:38 +0200 |
| Subject | Harmonic Analysis collides with Gabriels Horn [9-11 Math Incident] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) |
| Message-ID | <1181hr5$3de6$1@solani.org> |
| In reply to | #646834 |
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 NAVIER–STOKES or every positive viscosity, we construct a solution of the three-dimensional incompressible Navier–Stokes 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 > > ZMC（ZEN 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 π-WAM (currently integerish stuff) >> - π-WAM uses no atomics, only comms >> - π-WAM uses warp, 30-40% more speed >> - π-WAM runs on GPU and CPU >> - π-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: >>> >>> 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 >> >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2026-09-12 11:26 +0200 |
| Subject | Math has found a new Muse [Grothendieck Hodges] (Was: Harmonic Analysis collides with Gabriels Horn) |
| Message-ID | <11835s1$2g5m$1@solani.org> |
| In reply to | #647490 |
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 NAVIER–STOKES > or every positive viscosity, we construct a solution > of the three-dimensional incompressible Navier–Stokes > 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 >> >> ZMC（ZEN 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 π-WAM (currently integerish stuff) >>> - π-WAM uses no atomics, only comms >>> - π-WAM uses warp, 30-40% more speed >>> - π-WAM runs on GPU and CPU >>> - π-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: >>>> >>>> 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 >>> >> >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2026-09-12 12:14 +0200 |
| Subject | Kurzweils prognostic failure [Nabokov Fallacy] (Re: Math has found a new Muse [Grothendieck Hodges]) |
| Message-ID | <11838ld$2i6f$3@solani.org> |
| In reply to | #647494 |
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." — Speak, 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 NAVIER–STOKES >> or every positive viscosity, we construct a solution >> of the three-dimensional incompressible Navier–Stokes >> 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 >>> >>> ZMC（ZEN 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 π-WAM (currently integerish stuff) >>>> - π-WAM uses no atomics, only comms >>>> - π-WAM uses warp, 30-40% more speed >>>> - π-WAM runs on GPU and CPU >>>> - π-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: >>>>> >>>>> 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 >>>> >>> >> >
[toc] | [prev] | [standalone]
Back to top | Article view | sci.math
csiph-web