Algebra Argumentation Computer Science 
ED Surge
DECEMBER 10, 2024
In 2014, the district pushed algebra to ninth grade from eighth grade, in an attempt to eliminate the tracking, or grouping, of students into lower and upper math paths. The district hoped that scrapping honors math classes and eighth grade algebra courses would reduce disparities in math learning in the district.
Robert Talbert, Ph.D.
FEBRUARY 10, 2023
As I teach my Linear Algebra and Differential Equations class this semester, which uses more computing than ever, I'm thinking even more about these topics. If anything, over the past seven years, my feelings about the centrality of computing in the mathematics major have gotten even more entrenched.
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
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.
Stephen Wolfram
SEPTEMBER 27, 2024
Some involve alternate functional forms; others involve introducing additional functions, or allowing multiple arguments to our function f. But it turns out that the fact that this can happen depends critically on the Ackermann function having more than one argument—so that one can construct the “diagonal” f [ m , m , m ].
Stephen Wolfram
SEPTEMBER 29, 2023
Since the standard Wolfram Language evaluator evaluates arguments first (“leftmost-innermost evaluation”), it therefore won’t terminate in this case—even though there are branches in the multiway evaluation (corresponding to “outermost evaluation”) that do terminate. As the Version 1.0
Stephen Wolfram
AUGUST 29, 2024
In the end—after all sorts of philosophical arguments, and an analysis of actual historical data —the answer was: “It’s Complicated”. And there are also foundational questions in computer science. Lots of college students these days say they want to study “computer science”. OK, so that’s a lot of projects.
Stephen Wolfram
MARCH 5, 2024
But the computer let me discover just by systematic enumeration the 2-state, 3-color machine that in 2007 was proved universal (and, yes, it’s the simplest possible universal Turing machine). In 2000 I was interested in what the simplest possible axiom system for logic (Boolean algebra) might be.
Expert insights. Personalized for you.
291 
Let's personalize your content