Remove Argumentation Remove Calculus Remove Computer Science Remove Natural Sciences
article thumbnail

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

Stephen Wolfram

And if we’re going to make a “general theory of mathematics” a first step is to do something like we’d typically do in natural science, and try to “drill down” to find a uniform underlying model—or at least representation—for all of them. and zero arguments: α[ ]. &#10005. &#10005. &#10005. or: &#10005.

article thumbnail

The Concept of the Ruliad

Stephen Wolfram

Because it implies that whatever “computational parametrization” or “computational description language” one uses for the ruliad, one will almost always get something that can be viewed as “computationally equivalent”. But what about other models of computation—like cellular automata or register machines or lambda calculus?

Physics 122