Remove Argumentation Remove Calculus Remove Computer Science
article thumbnail

Revisiting the Legacy of San Francisco’s Detracking Experiment

ED Surge

When districts slot students into math classes based on ability they send conspicuous messages to those on the lower track that they are not smart enough, says Ho Nguyen, who was a K-12 math and computer science program administrator in San Francisco during the district's detracking attempt. Nevertheless, the attempt was tense.

Algebra 229
article thumbnail

What should mathematics majors know about computing, and when should they know it?

Robert Talbert, Ph.D.

If anything, over the past seven years, my feelings about the centrality of computing in the mathematics major have gotten even more entrenched. First, I know more computer science and computer programming now than I did in 2007. These days the computer plays a front-and-center role in all of my classes.

educators

Sign Up for our Newsletter

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

article thumbnail

Nestedly Recursive Functions

Stephen Wolfram

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 ].

Computer 107
article thumbnail

Expression Evaluation and Fundamental Physics

Stephen Wolfram

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

Physics 101
article thumbnail

The Physicalization of Metamathematics and Its Implications for the Foundations of Mathematics

Stephen Wolfram

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. and zero arguments: α[ ]. From a computer science perspective, we can think of it as being like a type hierarchy.

article thumbnail

Five Most Productive Years: What Happened and What’s Next

Stephen Wolfram

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.

Physics 110
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