I really like the illustrations and explanations. When can we expect the natural transformations chapter?
And also I think there is a small typo at the end of second to last paragraph.
"At the same time we have the category of groups, for example, which contains the category of monoids as a subcategory, as all monoids are groups etc.". The roles of monoids and groups are actually reversed - all groups are monoids, but not all monoids are groups.
I don't think you can learn your way to the cutting edge of science in a lifetime with project-based learning. In my experience it just takes too much time.
Same, but it's only natural after studying inner product vector spaces. Also being comfortable with some calculus is needed to be able to overlook the technicalities of this construction and focus on the actual idea.
"Clojure for brave and true" has in my opinion an excellent section on Clojure tooling in emacs (which I wish i read when I was starting out with emacs).
I feel like another application which is maybe not talked about all that much is that knowing category theory gives you power to name some design pattern, google that, and tap into that vast mathematical knowledge that humanity already discovered. This becomes incredibly valuable once you become aware of how much you don't know. Or maybe just write that bare manimum code that works, idc.
Oh and also when you recognize your design to be something from ct its probably quality. Shit code cant be described with simple math (simple as in all math is simple, not as in math that is easy to understand).
Drink enough wine and you will start to lean towards "critically acclaimed" wines by yourself after a while. What's "enough" varies from individual to individual.
Change of bases being done with orthogonal projection derived from defining scalar product of two functions via finite integral of product of two functions: f dot g = integral f(x)g(x)dx over some interval.
This is common misconception. The truth is that in HE every plaintext can be encrypted to (exponentially iirc) many different ciphertexts. During encryption one of those is chosen randomly. This makes dictionary attacks practically impossible.
Edit: HE scheme (lwe) works on individual bits. Meaning there are only two plaintexts (0,1). Each has exponentially many ciphertexts, only one chosen at random. They also share ciphertext space, meaning each ciphertext could be either encrypted zero or one.