[Exuma]

Trivial things: The busy beaver fast growing function, and how turning machines represent "all things computable". Somehow this was an epiphany I never realized... I always thought "x can be represented on a turing machine", and this itself always seemed like "so what." All it really means to me is you can play doom in your _random thing_ thats turing complete. Once I learned about the busy beaver function however, and n state turing machines, I had a massive epiphany that ive been thinking about it backwards. Whats better is to think that some N-State turing machine can represent EVERY POSSIBLE THING THAT CAN BE COMPUTED (!!!). And its like starting at the top of a very large infinitely tall pyramid, with an N(1) state turing machine and all its permutations of computation, and then N(2) and onwards. In this case, all the answers of the universe (or at least within the computational realm) exist within some N state turing machine in this pyramid.

https://www.youtube.com/watch?v=kmAc1nDizu0

Work things: typescript, nuxt 3, and converting my ENTIRE 10+ year vim config to fancy Neovim with full LSP support.