Computing Education Research Blog
NOVEMBER 26, 2021
My argument is that computer science was originally invented to be taught to everyone, but not for economic advantage. I see the LSA effort and our Teaspoon languages connected to the original goals for computer science. In 1961, the MIT Sloan School held a symposium on “Computers and the World of the Future.”
Robert Talbert, Ph.D.
FEBRUARY 10, 2023
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.
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
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
SEPTEMBER 9, 2021
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).
Stephen Wolfram
SEPTEMBER 9, 2021
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).
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. and zero arguments: α[ ]. From a computer science perspective, we can think of it as being like a type hierarchy.
Stephen Wolfram
AUGUST 22, 2023
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). “Lick” Licklider —who persuaded Ed to join BBN to “teach them about computers”. Nowadays we’d call it the trie (or prefix tree) data structure. But his name shows up from time to time.
Expert insights. Personalized for you.
140 
Let's personalize your content