ejenk

3 ms·

1. 1.▲
   by ejenk 10y ago

   Warning to Vimperator users: some Vimperator features are currently broken in this release. See https://github.com/vimperator/vimperator-labs/issues/568
2. 2.▲
   by ejenk 10y ago

   I'm sorry, but as a resident of Hyde Park for more than a decade, your experience could not be more alien to me. I have not once wished for the burden and expense of owning a car. Indeed, living here has convinced me that the personal
3. 3.▲
   by ejenk 11y ago

   From the article, you'd think these ideas were invented by Coecke and Chaitin from whole cloth. Graphical calculi for monoidal categories date back to Kelly and Laplaza (1980), with later refinements by Joyal-Street and Yetter. In inci
4. 4.▲
   by ejenk 12y ago

   Surely your monoid example should be a Sigma type (`exists`), not a Pi type (`forall`), since a monoid is a specification of data for a single type A, not for all types A. Indeed, the empty type has no monoid structure, so the Pi type you w
5. 5.▲
   by ejenk 12y ago

   I think the author has confused NP with NP-hard (or NP-complete). Indeed, it is extremely unlikely that the unknottedness problem is NP-complete, as it is already in NP ∩ co-NP (assuming the generalized Riemann hypothesis). Furthermore, we