Hacker News Reader

Comment by jacknews | Hacker News Reader

does it involve monads?

There's maybe a two-to-three-order-of-magnitude difference between the difficulty of monads and the difficulty of this stuff.

Monads are just monoids in the category of endofunctors, after all.

of course my post was slightly a joke

but is the relative difficulty, in human understanding, or a 'fundamental' difference in complexity?

surely the later is something mathematicians can and have measured?

Complexity has different meanings. People don't generally go and assign objective metrics of complexity to proofs, besides how long it is.

You could try to draw the stack of abstractions necessary to understand the proof and see how high it stacks, and you could try to call that fundamental complexity, but I don't think many people would be happy with that.

So yes, it's a difficulty in human understanding. What else could it be?

It's very common to track how many different axioms are needed for some result, and consider results with lower requirements to be more fundamental. "Less complex", probably not so much, but the issue is something that a number of people care about.

Very common might vary by area. If you work near the foundations, I could see that, sure.

Of course it does. It uses category theory after all

https://people.mpim-bonn.mpg.de/gaitsgde/GLC/Loc.pdf (the second paper, more than 400 pages), ctrl+f monad

It's not a lot of monads. There are wayyy more functors for example

Reply on news.ycombinator.com