Stephen Wolfram

MARCH 5, 2024

In 2000 I was interested in what the simplest possible axiom system for logic (Boolean algebra) might be. of what’s now Wolfram Language —we were trying to develop algorithms to compute hundreds of mathematical special functions over very broad ranges of arguments. Perhaps even the architecture of the network can change.

Science 116

Science Sciences Computer Mathematics 116

Stephen Wolfram

SEPTEMBER 9, 2021

Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. Imagine for example that one has a neural net with a certain architecture. The systems can be based on Boolean algebra, database updating or other kinds of ultimately computational rules.

Physics 66

Physics Science Sciences Mathematics 66

Stephen Wolfram

SEPTEMBER 9, 2021

Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. Imagine for example that one has a neural net with a certain architecture. The systems can be based on Boolean algebra, database updating or other kinds of ultimately computational rules.

Science 60

Science Sciences Physics Mathematics 60

Stephen Wolfram

AUGUST 22, 2023

Then McCarthy started to explain ways a computer could do algebra. It was all algebra. And the only conclusion we can arrive at is that a person can’t do this much algebra with the hope of getting it right.” Richard Feynman and I would get into very fierce arguments. And he says “There’s a problem. It’s just my nature.

Computer 69

Computer Physics Science Sciences 69

Stephen Wolfram

NOVEMBER 10, 2021

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 117

Physics Mathematics Computer Construction 117