A strange but rather entertaining post: proof that Vim keystrokes are Turing-complete.

#vim #cs

The title intrigued me: "Nearly All Binary Searches and Mergesorts are Broken". Heart racing. Pupils dilated. What did they find? int overflow. Phhh...

#cs #algorithm #bug

I know that many of you do stuff like Advent of Code. Many others (me, for example) are too busy lazy for this stuff. Well, Peter Norvig (Research Director at Google) is not that case, so he has this cool repo full of ipynb's with problems, solutions, nice graphs and illustrations. And you'll find much more than just AoC there!

#contest #cs #repository

More from Vitalik. There's this interesting data structure: Merkle tree. The post is about Verkle trees. Similar thing, but with much more compact proofs.

#datastructure #crypto #cs

An interesting example of what's possible with modern compilers. The post is about Dafny lang, it can prove or disprove in compile time certain assertions we add to our code.

#compiler #language #cs

An explanation of bloom filters. This data structure allows to check if a value is in a set with constant time and small memory overhead. Subject to false positives though.

#cs #datastructure

Men^W Humans will literally do anything instead of going to therapy. FLAT ORIGAMI IS TURING COMPLETE. Don't try to fully comprehend the paper, your sanity is much more important, just enjoy the little pieces.

#science #math #cs

A nice dive into how one of the simple versions of CRDT works.

#cs #network #datastructure

CRDT series continues. There won't be more details on the algorithm itself, but there will be a post on how to build a toy pixel art editor with it and a post with various strange optimizations for the amount of data transferred.

#cs #network #datastructure