In Mathematica/Wolfram Languege, the part 0 of an expression is reserved for the head of the expression: f[x, y, z][[0]] == f. Or g[f][x, y][[0, 1]] == f.

Scott's thots part 2

I am also trying to learn wasm via the zig route:

* A minimal example showing how HTML5's canvas, wasm memory and zig can interact: https://github.com/daneelsan/minimal-zig-wasm-canvas

* This mini game shows how Zig, WASM, Javascript and HTML5 canvas can interact: https://github.com/daneelsan/Dodgeballz

* WEFX is a simple graphics drawing package using Zig, WASM, and an HTML canvas: https://github.com/daneelsan/zig-wefx

And just now console.log() :) https://github.com/daneelsan/zig-wasm-logger

My goto right now is to listen to One Piece OST.

There is a difference between online education because there is no other way as there is a pandemic (are the students and the institution ready to switch to online, are the courses even designed to be imparted online, etc.), and online education because it's a choice.

Would it be profitable, though?

I'm not sure why comments mention CA. His physics theory and the multicomputation stuff does not make use of CA's (at least no more than any other abstract machine).

Didn't he invent a numbering schema for classifying CA? That should count as an achievement.

The fact that no one could possibly have a clue what this sentence means is a pretty good indication of how important this work was.

OK bud

> it's nothing more than noodling cellular automata in ways that have had no effect whatsoever on chemistry, physics, or biology.

I mean, you could at least read a bit about what his Multicomputation stuff is really studying. CA are not being noodled there.

For those of us that are not going to read Wolfram's papers, what is multicomputation?

In short, Wolfram uses this term to describe distributed local state updates of a global state space. In his particular model, the global state space is a hypergraph, and the state updates are replacements of some local subgraphs with other subgraphs. This happens in parallel in all sorts of places, which is a not-too-surprising generalization of cellular automata.

And that's it. It's not very deep, and nobody outside his sphere of influence uses this term for that purpose.

The thing with Stephen Wolfram is that he invents all those terms, uses them as if they are standard terminology in the field (of physics or computer science) while freely mixing them with _actual_ standard terminology. That goes for "branchial graph", "rurial space", "principle of computational equivalence" and also "multicomputation". He is just diving deeper and deeper into his own buzzwordial space.

Seconded -- I don't have much interest in reading the guy's own writing at this point, but I'll gladly read a concise summary that leaves out all the boasting since I assume there might be some actual "content" buried in there.

Yes