niplav @niplav@schelling.pt

Brian Tomasik

(believe me, I tried to add more insects)

One of those abstracts where you feel like you're having a stroke

who of you

Ah well there was an attempt

@scatach@stereophonic.space found ya

Double-U Tee Fuck

http://niplav.site/text_reviews#What_We_Owe_The_Future_William_MacAskill_2022

Economic policy checklist

Text at https://www.lesswrong.com/posts/oTaku2oCFC8ya5F3L/open-thread-june-2023-inline-reacts?commentId=5W7LEsBDhKgksGngt

Source: https://twitter.com/cqeet/status/1659193683001090052

Uuhhh....
Ummmmm

https://www.esquire.com/lifestyle/a22777589/what-is-mastodon-twitter-platform/

@TetraspaceGrouping ill go full patent troll on the jokes you extract from me ☔

One more: https://kaarelh.github.io/

• PCS and all c∈C have minimum graph edit distance of i. (Proof sketch: There is a graph for which all acyclic tournaments with the same (minimal) graph-edit distance don't contain a specific subgraph). Graph in picture, the minimal edit distance is 3, the non-preserved consistent subgraph is a2→a4. This extends to arbitrarily big consistent subgraphs (replace all edges with acyclic tournaments with n nodes).