@boarders
Thanks to impermanence all things are possible Working on a book on topos theory
wrote a lean proof of the solution to the MU puzzle from gödel, escher, bach
Added tested --examples which is also searchable, this one showing how comparing fits together with the alternative operator <|> the language has
have been working on my own haskell-ish json query language (which also compiles to jq) and I'm really starting to be happy with how it looks
if you'll believe it my current rough notes have this exact sentence since the first model I consider is exactly just a wrapper around Callable[[V], V] (sadly writing python as this is what is available in colab)
[continuing] illustration of the central limit theorem for a random walk. You flip a coin and if it is tails you stay where you are, if it is heads you flip another coin and go left on tails and right on heads. After 1000 steps where you end up closely mirrors a gaussian (with variance √(250 · 1/2))
working on an exploratory markov chain notebook for fun, and getting to the point of spending all the time on it getting worse and worse visualizations as I go
having fun trying to finish my project on heyting-valued sets before starting new job
have been working on using Verso to get lean developments to render on my blog with hover over proof state - feel happy with the result and will probably write up something about kripke semantics as a reasonable test run
started a project which was meant to be "learning something about EE" and has gone way off track
thinking for the first time in a long while about combinators for term traversals like this one - map over syntax with debruijn indices where we keep some state that is updated as we go under a binder
proof of eckman--hilton, really leaves something to be desired and I wonder how a nicer version would look (in terms of syntax)
getting started on basic topos theory, will need to take a detour into lattice theory + developing that Hom 1 Ω is a lattice (not sure how to develop that it is an internal lattice object atm)
returning to my learning project of working through 'From Mathematics to Generic Programming' in rust. In chapter 1, stepanov computes an optimized algorithm for "egyptian multiplication" so I tried out kani to verify it (hoping to figure out something it will be genuinely useful for)
almost got to some elementary topos theory, can now express that a cartesian closed cat with zero object is degenerate (every hom set is subsingleton)
I thought I'd set up various specialized notions of limits (products, equalizers, pullbacks etc.) and then a theory of general limits as universal cones, and then show the former are special cases of the latter, but in practice it seems surprisingly painful to write out all the details
working on the general theory of limits, only got far enough to prove uniqueness before I had to stop
working on basic theory of finite limits, here I am, rather laboriously, proving that having products + equalizers means a cat has pullbacks
moving towards elementary toposes, just got function objects set up to a usable extent and here is eta for exponentials
Proving Type has Prop as a subobject classifier: essentially amounts to some miniature version of the grothendieck construction where you take a mono i : X -> Y to the prop : Y -> Prop, \y -> fiber i y
finally parried but was right to be put off, looks like you need a phd to write this basic proof (only looks so, for I am a drop out)