Path: csiph.com!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Mild Shock Newsgroups: comp.lang.java.programmer Subject: =?UTF-8?Q?=cf=80-WAM_Assembly:_Jump_and_Link_for_Tseytin_Transforma?= =?UTF-8?Q?tion_=28Re:_Blum=e2=80=99s_Speed-Up_Theorem_and_Sudoku=29?= Date: Fri, 21 Aug 2026 23:28:46 +0200 Message-ID: <116afue$sc9v$2@solani.org> References: <115ge5u$aml4$4@solani.org> <115ntel$fme2$3@solani.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 21 Aug 2026 21:28:46 -0000 (UTC) Injection-Info: solani.org; logging-data="930111"; mail-complaints-to="abuse@news.solani.org" User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:140.0) Gecko/20100101 Firefox/140.0 SeaMonkey/2.53.24 Cancel-Lock: sha1:dXBFT/4idnE64qbN43cF2wNerts= In-Reply-To: <115ntel$fme2$3@solani.org> X-User-ID: eJwFwYERgDAIA8CVJCQRx+lR2H8E/5UO90vL1GpHiqr8MGAgNi4nu00/nYtSB5l8ofape7YRgm57DgfnBytAFPM= Xref: csiph.com comp.lang.java.programmer:53772 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/ >