Remove Argumentation Remove Calculus Remove Computer Science Remove Equality
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. and at t steps gives a total number of rules equal to: &#10005. which we can read as “there exists something a for which equals a ”.

article thumbnail

Computational Foundations for the Second Law of Thermodynamics

Stephen Wolfram

Sometimes textbooks will gloss over everything; sometimes they’ll give some kind of “common-sense-but-outside-of-physics argument”. Once one has the idea of “equilibrium”, one can then start to think of its properties as purely being functions of certain parameters—and this opens up all sorts of calculus-based mathematical opportunities.

article thumbnail

The Concept of the Ruliad

Stephen Wolfram

For integers, the obvious notion of equivalence is numerical equality. Then (by the assumed properties of equality) it follows that. But what about other models of computation—like cellular automata or register machines or lambda calculus? Some correspond to theoretical computer science.

Physics 122