what that looks like
According to Wolfram (& I agree :), everything is a cellular automaton, so comparing to CGL made more sense to me.
The really weird part is that when I fetch https://eavan.blog/sandpile.js in Chrome, I see a "toppleAll" function near the top, but that same function is not defined when the script is fetched with Firefox.
"Clickbait is Unreasonably Effective", 2021 - Veritasium's apologia for clicbait titles and and thumbnails, and statement of principles.
Veritasiuk has at least stuck making soldi educational videos, as Mark Rober has let slip away his past effort to educate in addition to demonstrate his cool toys.
If something is not associative it is not a group. An abelian group is a group which is commutative.
If you look in an abstract algebra textbook they all basically say the same definition for abelian groups (eg in Hien)
> “A group G is called abelian if its operation is commutative ie for all g, h in G, we have gh = hg”.
In more advanced texts, they could simply say that a group is a moniod with inverses and could (by your reasoning, should) avoid specifying that groups are associative since this is a property of all monoids.
> “ A semigroup is a set endowed with an associative operation; a monoid is a semigroup with an identity element. Thus a group is a monoid in which every element has an inverse”.
If I haven't defined mammals, I say that bats are warm blooded animals that produce milk for their young, etc., but if I have (or expect my readers to know what a mammal is) I can just say they are mammals.
This has causality backwards—being a group requires an identity element. You can't show something is a group without knowing that the identity element exists in the first place.
In fact, a good chunk of how this article talks about the math is just... slightly off.
1. Fill a grid with all 6s, then topple it.
2. Subtract the result from a fresh grid with all 6s, then topple it.
So effectively it's computing 'all 6s' - 'all 6s' to get an additive identity. But I'm not entirely sure how to show this always leads to a 'recurrent' sandpile.
EDIT: One possible route: The 'all 3s' sandpile is reachable from any sandpile via a sequence of 'add 1' operations, including from its own successors. Thus (a) it is a 'recurrent' sandpile, (b) adding any sandpile to the 'all 3s' sandpile will create another 'recurrent' sandpile, and (c) all 'recurrent' sandpiles must be reachable in this way. Since by construction, our 'identity' sandpile has a value ≥ 3 in each cell before toppling, it will be a 'recurrent' sandpile.
skeltoac•1mo ago