niplav @niplav@schelling.pt

Cheat code to Bergsonianism:

Time is the most scarce resource in my field. And yours too, probably.

@lisyarus Turing completeness is the empirically unique reasonable notion of computability for functions Nat -> Nat, but for (Nat -> Nat) -> Nat (aka type-2 computability) there are multiple reasonable notions of computation that are not equivalent, so there is no such thing as “Turing completeness” there

#30daymapchallenge Day 2 (Lines): Sequential postcodes of Germany, making use of the unpopular 🌈 rainbow color map. This map was inspired by Kate, aka @pokateo_maps on the bird site.

https://x.com/pokateo_maps/status/1587868578874785794

a huge rat just scurried up and looked at me

Algebraic derivatives living over vector spaces with tensor product would probably be the easiest thing to figure out, surely some commutative algebraists would care about such a thing

I feel like a lot of mathematicians would be interested in the fact that we know how to generalise the chain rule to non-cartesian settings using optics, if only we had examples that they'd be interested in. The first thing I can think of is trying to get a chain rule for the derivative of a function that's a stochastic process, where the value of the function and its derivative are probabilistically correlated