à propos of nothing, earlier conversation with recalled my experience writing what i would characterize as "dense hypermedia", where all digressions/parentheticals were given their own page.
the number of drafts increased ~quadratically to the actual intended product.
Conversation
this made me think of how random walks are √n steps from the origin on average, and kinda had a miniature holy-shit moment
1
2
a complete graph has (n²-n)/2 edges for n nodes, so it's not quite the square, but it's proportional
(take away the /2 for directed graphs)
1
2
anyway thinking about this from hamming's book, and…
Quote Tweet
2
1


