Remove Argumentation Remove Calculus Remove Computer Science Remove Transportation
article thumbnail

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

Stephen Wolfram

At the level of individual events, ideas from the theory and practice of computation are useful. Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. And the same issue arose for Alonzo Church’s lambda calculus (introduced around 1930).

Physics 65
article thumbnail

Multicomputation: A Fourth Paradigm for Theoretical Science

Stephen Wolfram

At the level of individual events, ideas from the theory and practice of computation are useful. Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. And the same issue arose for Alonzo Church’s lambda calculus (introduced around 1930).

Science 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

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

Stephen Wolfram

It didn’t help that his knowledge of physics was at best spotty (and, for example, I don’t think he ever really learned calculus). “Lick” Licklider —who persuaded Ed to join BBN to “teach them about computers”. Nowadays we’d call it the trie (or prefix tree) data structure. But his name shows up from time to time.

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

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