From Newsgroup: comp.lang.c



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:

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 Newsgroup: comp.lang.c

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

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Mild Shock pisze:

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

are you alive or only youre spam bot here?
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

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

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Mild Shock wrote:

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.

Dude Mild Shock is a tube-necked giraffe if he thinks Mars is any kind
of low hanging fruit. One step at a time. You guys don't even live on
the moon (Luna) yet.
--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Mild Shock wrote:

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:

You talk about low hanging fruits. Tell me why the Moon (Luna) is a sour grape. Then I will ask you to please direct your criticism at Mars,
filled with poisonous, radioactive dust, low gravity to expound on the
current zero gravity problems spacers experience, greater distance (if
you hadn't already appreciated this), and general state of unknown that
you don't even know what to criticize yet.

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c

Hi,

Non-uniform memory access (NUMA) is a computer
memory design used in multiprocessing, where the
memory access time depends on the memory location
relative to the processor.

The future Numa Brains will be gorgeous. In like
3-4 years from now, they might have 3.2 TB RAM
on a SOC, by not using HBM but HBF:

High Bandwidth Flash: What Is It Good For? https://www.youtube.com/watch?v=3nTpW52nioI

There might be new profession like nosomatic
AI chirurgeon (I made that up):

Tiny engine, immense model
https://github.com/JustVugg/colibri

The Brain page, Explore: the measured expert
atlas of GLM-5.2 drawn as a cortex. 13,260
characterised experts in ten regions (Python,
SQL, mathematics, poetry, law, ChineserCa);

position is measured routing affinity, not a
learned embedding. We might want a brain to
amputate from the Python expert sections, so

that we can write code without a slow
CPython runtime.

Bye

Mild Shock schrieb:

Hi,

A nosomatic AI chirurgeon is a halfling student
of sickness, and a master of the ebb and flow of
the energies of life and death of data packets.

He is a air bender, water bender and earth bender
in one person, using OpenVINO to juggle with
CPU, GPU and NPU.

Last but not least he can freely switch between
symbolic and neural representation of knowledge
forms, there is no abyss for him.

Bye

--- Synchronet 3.22a-Linux NewsLink 1.2

From Newsgroup: comp.lang.c


Hi,

Yesterday I had the feeling P(doom E-graphs) > 10%,
since they have E-boost intiatives where they use
parallism and more heuristics, also tapping into GPUs,

TPUs, NPUs, etc.. you name it. So Prolog might sooner
or later feel the wind of E-boost Schinkansen? Now
I have the feeling the E-graph community is still

in the nowhere of la la land. Reading:

recording out of egraphs
https://www.philipzucker.com/

WTF is "recording out" ? Look at that beauty of
SWI-Prolog unifiable/3 predicate. It can even deal
with cyclic terms:

?- unifiable(f(X,X,X),f(Z,b,Y), L).
L = [Y=b, X=b, Z=X].

?- unifiable(f(X,Y),f(f(A,Y),f(B,X)), L).
L = [Y=f(B, X), X=f(A, Y)].

You can even code unifiable/3 in 100% Prolog itself,
BTW I am not saying it would be pure. But it wont need
any extensions that go beyond ISO core standard.

You could even experiment with a unification that
does minimization (*), but most Prolog systems don't
do that for their unification:

?- unifiable(X, f(f(X)), L).
L = [X=f(f(X))].

Bye

(*)
Gerhard Huet was all in for minimizations, but the sad
news is while terms have minimal forms, equations don't
really have unique minimal forms, this transpired only later.

RESOLUTION D'EQUATIONS DANS DES LANGAGES D'ORDRE 1,2,.rCorCo, https://www.researchgate.net/publication/213879499

Algorithms for equivalence and reduction to minimal form https://hal.science/hal-01239749v1/document

Mild Shock schrieb:

Hi,

Non-uniform memory access (NUMA) is a computer
memory design used in multiprocessing, where the
memory access time depends on the memory location
relative to the processor.

The future Numa Brains will be gorgeous. In like
3-4 years from now, they might have 3.2 TB RAM
on a SOC, by not using HBM but HBF:

High Bandwidth Flash: What Is It Good For? https://www.youtube.com/watch?v=3nTpW52nioI

There might be new profession like nosomatic
AI chirurgeon (I made that up):

Tiny engine, immense model
https://github.com/JustVugg/colibri

The Brain page, Explore: the measured expert
atlas of GLM-5.2 drawn as a cortex. 13,260
characterised experts in ten regions (Python,
SQL, mathematics, poetry, law, ChineserCa);

position is measured routing affinity, not a
learned embedding. We might want a brain to
amputate from the Python expert sections, so

that we can write code without a slow
CPython runtime.

Bye

--- Synchronet 3.22a-Linux NewsLink 1.2