The third and final post on impartial games is out. Nothing to crazy, just some more in-depth examples of the Sprague-Grundy theorem in action.
Just stumbled onto one of the coolest things I have seen in a while. Henry Segerman demonstrating projections with non-Euclidian geometry. He also does a great job of explaining what is going on for those who (like me) know/understand next to nothing about the subject.
The second post, in what I think will be a three part series on impartial games, is now up on my blog! In it, we cover how to use the Sprague-Grundy function\theorem and the solution to the game of Nim.
"Last week Harvard University and the Massachusetts Institute of Technology sold their #edX platform to a for-profit company for $800 million.
Before the sale, edX was academe’s public option — a mission-aligned satellite of the brick-and-mortar campus. Now all the major players in the sector are profiteers, legally obligated to maximize shareholder return."
– Jefferson Pooley, for Chronicle.com
(reader view in Firefox shows the full text)
At a recent dinner with my partner we started talking about her advanced field study and the ranking/matching process. Great excuse to talk about the Gale-Shapley algorithm and the stable matching problem!
Undergraduate CS Student at UCI. Heavy interest in Algorithmic Game Theory, Theory of Computation, Graph Theory and some other stuff!
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!