89 karma · joined April 19, 2018
It's hackable enough to have various plugins built for it that I need to use sometimes. For example, proof general and modes for specific languages.
Also, I like that Emacs is extremely polished. When I am working with someone who uses VS on windows they will typically have projects break for no reason and generally a more buggy experience
Being able to reduce everything down to an analogy about monkeys fighting over a banana or a dick measuring contest is just the reality of economics. One could even argue that it's an inherent aspect of being alive, at risk of sounding like a social darwinist.
The only thing I can think of is to replace the god awful default text editor. I noticed they changed it a while ago (from when it was called Gedit) but it's still garbage. Not that this really matters when we have Emacs...
As a user, I'm happy with ubuntu. Stability is important to me.
In other words: these are polynomials with n variables. every variable is either zero or one. addition is modulo 2. Each variable corresponds to a single bit in a binary number. Can we construct a polynomial that produces any given length 2^n sequence?
One way this is done by induction on the number of variables. I find this proof to be extremely compelling. I derived it myself one time and it has stuck with me.
The faster way to do this is through a Walsh transform. This proof converts the problem to a matrix equation by simply manipulating a sum. The Walsh matrix itself is an interesting fractal because it's a Hadamard matrix.
These two simple proofs give different perspectives