Teaser for the upcoming paper inspired by “Occurrence Theory: Where Physics is Born”
An algebraically forced Born-type probability
Occurrence Theory II: The Born Exegeses and the Mathematical Toll of Emergence
Yet, if Occurrence Theory is to be a predictive, physical description of reality rather than a mathematical art project, we must pay the exact mathematical toll that physics demands. We cannot rely on poetic analogies. We must show exactly how the continuous, dissipative, non-associative steps of the sedenionic engine are read out—via the five Born Exegeses—to recover the smooth, conservative, and unitary laws of quantum field theory
CAST Club: State v. Alan Turing (Computation’s About State Transformations)
The setting is the High Court of Computation. / Judge Lovelace presides. // The charge: violation of the MUTH statute, including assault with a deadly theorem and obstruction of state legibility. // Namely, knowingly rendering computation legible to mathematics in a way that made state transformations illegible to humans.
MUTH Club: Math as Engineering, not Science
Arithmetic that doesn’t terminate is not mathematics. / It’s wishful thinking with symbols…
Diaphorum 2: Spencer-Brown’s Laws of Formless
In Laws of Form, I began with the mark: the act of drawing a distinction. / Yet the mark itself presupposes something deeper-- a prior domain in which no geometry is given. / Here I present a successor: The Laws of Formless, a calculus that precedes the making of form…
Diaphorum 1: The Riddle Underlying Math and Physics
Here we explore a hypothetical construct, the diaphorum, motivated by a playful challenge from theoretical physicists: can one imagine a structure so basic that geometry, causality, and quantum texture all emerge from it?
Grammagraph: How Typed AI Compresses Syntax into Semantics
Grammagraphs offer a formal, compositional, and learnable structure that bridges syntax and semantics, allowing AI systems to extract low-dimensional meaning from high-dimensional expression—guided by types, structured by categories, and compressed via geometry.
Making Math Learn: Bauer vs Spivak on a Type Theory for AI
Not trained, Andrej. Learned. As in: the structure is fixed—types, arrows, limits— and the learning fills in the terms. A child writes in crayons over the architect’s blueprint.
A Language With No ‘=’: My Journey to Homoiconic C
came of age in the 1980s, as the C programming language and UNIX operating system were becoming the gold standard for "serious" computing. I was taught that: - Lisp reflects how computers **think** - C reflects how computers **work** - Shell scripts reflect how humans **write** I never questioned this split ....
TSM-13: Saul Youssef and Mark Burgin Discuss Homoiconic C’s “Named Frames”
Mark Burgin: Saul! I just finished reading about Homoiconic C and its concept of “named frames.” It struck me as an interesting middle ground between my named set theory and your pure data foundation. What’s your take on it?
iHack, therefore iBlog 
You must be logged in to post a comment.