Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Newsgroups | comp.lang.prolog, sci.logic, sci.math |
| Subject | Harmonic Analysis collides with Gabriels Horn [9-11 Math Incident] (Was: Accelerate Lean! From Theorem 3.11 to Corollary 3.12 [ZMC]) |
| Date | 2026-09-11 20:38 +0200 |
| Message-ID | <1181hr5$3de6$1@solani.org> (permalink) |
| References | (1 earlier) <10p4dif$1nve7$1@solani.org> <112b732$20pmt$1@solani.org> <112b7iu$20q3i$1@solani.org> <113cqbm$85b9$1@solani.org> <113ilkt$2ouu$1@solani.org> |
Cross-posted to 3 groups.
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 >> >
Back to sci.math | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
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
csiph-web