Remove Algebra Remove Argumentation Remove Calculus Remove Transportation
article thumbnail

LLM Tech and a Lot More: Version 13.3 of Wolfram Language and Mathematica

Stephen Wolfram

Line, Surface and Contour Integration “Find the integral of the function ” is a typical core thing one wants to do in calculus. But particularly in applications of calculus, it’s common to want to ask slightly more elaborate questions, like “What’s the integral of over the region ?”, or “What’s the integral of along the line ?”

Computer 118
article thumbnail

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

Stephen Wolfram

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). The systems can be based on Boolean algebra, database updating or other kinds of ultimately computational rules.

Physics 65
educators

Sign Up for our Newsletter

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

article thumbnail

Multicomputation: A Fourth Paradigm for Theoretical Science

Stephen Wolfram

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). The systems can be based on Boolean algebra, database updating or other kinds of ultimately computational rules.

Science 64
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). Then McCarthy started to explain ways a computer could do algebra. It was all algebra. Richard Feynman and I would get into very fierce arguments. And he says “There’s a problem.

article thumbnail

The Concept of the Ruliad

Stephen Wolfram

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. But what about other models of computation—like cellular automata or register machines or lambda calculus?

Physics 122