Stephen Wolfram

MARCH 7, 2022

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 ? We’ve looked at axioms for group theory and for Boolean algebra.

Mathematics 120

Mathematics Physics Computer Algebra 120

Stephen Wolfram

MARCH 5, 2024

My first big success came in 1981 when I decided to try enumerating all possible rules of a certain kind (elementary cellular automata) and then ran them on a computer to see what they did: I’d assumed that with simple underlying rules, the final behavior would be correspondingly simple. Yes, there can be a lot of flexibility in this model.

Science 122

Science Sciences Computer Mathematics 122

Stephen Wolfram

SEPTEMBER 9, 2021

Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. In physics, those “topological phenomena” presumably correspond to things like elementary particles , with all their various elaborate symmetries.

Physics 65

Physics Science Sciences Mathematics 65

Stephen Wolfram

SEPTEMBER 9, 2021

Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. In physics, those “topological phenomena” presumably correspond to things like elementary particles , with all their various elaborate symmetries.

Science 64

Science Sciences Physics Mathematics 64

Stephen Wolfram

JANUARY 9, 2024

In addition to whole courses, we have “miniseries” of lectures about specific topics: And we also have courses —and books—about the Wolfram Language itself, like my Elementary Introduction to the Wolfram Language , which came out in a third edition this year (and has an associated course, online version, etc.): is PositionSmallest.

Computer 102

Computer Calculus Construction Accessibility 102