dann

@rtweed It's often necessary to traverse edges in both directions, so it's difficult to build the structure without circular references. You could put the all edges into a node:node map instead of embedding them directly, but you'll lose the index-free adjacency performance advantage.

@dann Found an issue - the addEdge() API creates a circular reference which DPP's deep proxy isn't able to cater for (infinite loop!). I wonder could edges be defined without such circular refs? What do you think?

@dann Been looking at your Dagoba Graph Database implementation in JavaScript. Hook it up to DPP and you have a persistent Graph Database running in the browser, which is pretty cool! github.com/robtweed/DPP

This schematisation by @dann is an interesting way to classify data structures — by analysing if they are abstract specifications/concrete implementations: youtu.be/2XH_q494U3U?t=…

Thrilled that our paper on Ecological Memory Management won the coveted "Forgot to remove page numbers" award at SIGBOVIK! Read it here: orca.garden/pdf/Ecological…

@podpeerpleasure Hey, thanks! I listened to a few episodes, it was nice to hear what everyone has been up to over the years. Sounds like a ton of fun doing the podcast too. Say hi to the old crew for me!

@dann Thanks buddy! I’ve watched a few of your talks on YouTube and you are doing some amazing things in tech. I always knew you would change the world. I remember you were the first person to show me what google was haha. Crazy!

@dann hey buddy! It’s Dewey your old roommate from Portland! Hope you are well!

Exploring cellular automata with my kids, our five year old came up with an interesting set of rules that counts in binary. Anyone seen anything like this before? #Binary%20counting:s,21,1;s,22,1;s,21,0;s,22,0;s,15,1;r,1,1;r,4,1;r,9,1;r,14,1;r,20,1;r,21,1;r,30,1;r,30,0;r,27,1;r,31,12;r,13,12;r,30,12;r,30,0;r,31,0;r,23,12;r,23,0;r,22,12;r,22,0;r,27,12;r,28,12;r,28,0;r,27,0;r,29,12;r,31,12;s,29,12;s,29,0;s,24,3;r,31,3;r,31,0;r,29,3;r,31,3;r,29,12;r,31,12;s,24,12;s,24,0" target="_blank" rel="nofollow noopener">inatree.net/#Binary%20coun…

CALL FOR PAPERS: Computational Governance and Majoritarianism We're delighted to be working with @mansoor_a_r @Cambridge_CL @dann Hazem Danny Al-Nakib @uclcbt Workshop 28 Oct (deadline for papers 24 Sep), leading to a special collection in D&P. bit.ly/3k1oIze

"You know, people think mathematics is complicated. Mathematics is the simple bit. It's the stuff we can understand. It's cats that are complicated". RIP John Conway

Want to help with #COVID19 while you're social distancing? @torontojs has partnered up with @DevEdmonton to help with @codevid19 Hackathon! Lets solve this together!! #CODEVID19 #COVID19 #TorontoJS

While I was in grad school at CMU, I had the honor and privilege of learning from prof. John Reynolds. He was brilliant, but also incredibly humble. After knowing him, I stopped giving a pass to the "asshole genuis" types. Here are some stories. 1/

@pedantic_grue One of the advantages of the 500 line constraint is that the code should be relatively easy to port. (Keeping the stateful parts mostly contained should help here too.) Send me a link if you end up doing that!

@pedantic_grue Good question! I vaguely remember considering a LINQ implementation of Dagoba, and on the surface it seems like it should translate fairly well.

Write code. Mostly simple. Not too much.

People tweet all sorts of things about real numbers, especially when it comes to computation. I've studied the topic for years, and I often disagree with such statements. Let me address just one such statement: "A computer cannot represent all reals, only the computable ones."

RT @axbom: 1) In 2008 a salmon (yes the fish) was put through an MRI scanner. The salmon was shown a series of photographs of humans in soc…

RT @OneTrueDabe: Thanks to @dann for the informative and entertaining "500 Lines or Less | Dagoba: an in-memory graph database" As an exer…

@wxswxs Knuth’s Surreal Numbers novella is an interesting take on this.

What are numbers made out of?

Anyone know of a Banach-Tarski-like construction that allows reassembly of a sphere from any sufficiently large subset of pieces (e.g., any three out of five)?