article thumbnail

The Physicalization of Metamathematics and Its Implications for the Foundations of Mathematics

Stephen Wolfram

One can view a symbolic expression such as f[g[x][y, h[z]], w] as a hierarchical or tree structure , in which at every level some particular “head” (like f ) is “applied to” one or more arguments. So how about logic, or, more specifically Boolean algebra ? It’s worth mentioning just one further subtlety. &#10005. &#10005.

article thumbnail

Even beyond Physics: Introducing Multicomputation as a Fourth General Paradigm for Theoretical Science

Stephen Wolfram

Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. In physics, energy (and mass) act as a “source of gravity”. In general relativity, the singularity theorems say that when there’s “enough energy or mass” it’s inevitable that a singularity will be formed.

Physics 64
educators

Sign Up for our Newsletter

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

article thumbnail

Multicomputation: A Fourth Paradigm for Theoretical Science

Stephen Wolfram

Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. In physics, energy (and mass) act as a “source of gravity”. In general relativity, the singularity theorems say that when there’s “enough energy or mass” it’s inevitable that a singularity will be formed.

Science 64
article thumbnail

Remembering the Improbable Life of Ed Fredkin (1934–2023) and His World of Ideas and Stories

Stephen Wolfram

But at a personal and social level it was still always a lot of fun being around Ed and being exposed to his unique intense opportunistic energy—with its repeating themes but ever-changing directions. Then McCarthy started to explain ways a computer could do algebra. It was all algebra. And he says “There’s a problem.

article thumbnail

The Concept of the Ruliad

Stephen Wolfram

For example, we know (as I discovered in 2000) that (( b · c ) · a ) · ( b · (( b · a ) · b )) = a is the minimal axiom system for Boolean algebra , because FindEquationalProof finds a path that proves it. And we can trace the argument for this to the Principle of Computational Equivalence.

Physics 121