July 11, 2016 by Chris on Web Bookmarks

Bookmarks for July 10th

July 7, 2016 by Chris on Web Bookmarks

Bookmarks for July 7th

GitHub – aantix/emotional_framework: A series of questions and guidelines to reach peace with any situation. – <blockquote>emotional_framework – A series of questions and guidelines to reach peace with any situation.</blockquote>
Bee Bread — Nordic Food Lab –
GitHub – joshnewlan/say_what: Using speech-to-text to fully check out during con calls – <blockquote>say_what – Using speech-to-text to fully check out during con calls</blockquote>
Mental Models I Find Repeatedly Useful — Medium – <blockquote>Around 2003 I came across Charlie Munger’s 1995 speech, The Psychology of Human Misjudgment, which introduced me to how behavioral…</blockquote>

July 5, 2016 by Chris on Web Bookmarks

These are my links for July 4th through July 5th:

May 13, 2016 by Chris on Web Bookmarks

April 10, 2016 by Chris on Web Bookmarks

These are my links for July 20th through July 24th:

Ask HN: Best-architected open-source business applications worth studying? | Hacker News -
Monospaced Programming Fonts with Ligatures | Hacker News -
The language of choice - Propositional logic was discovered by Stoics around 300 B.C., only to be abandoned in later antiquity and rebuilt in the 19th century by George Boole’s successors. One of them, Charles Peirce, saw its significance for what we now call logic circuits, yet that discovery too was forgotten until the 1930s. In the ’50s John McCarthy invented conditional expressions, casting the logic into the form we’ll study here; then in 1986 Randal Bryant repeated one of McCarthy’s constructions with a crucial tweak that made his report “for many years the most cited paper in all of computer science, because it revolutionized the data structures used to represent Boolean functions” (Knuth).1 Let’s explore and code up some of this heritage of millennia, and bring it to bear on a suitable challenge: playing tic-tac-toe.
Then we’ll tackle a task that’s a little more practical: verifying a carry-lookahead adder circuit. Supposedly logic gets used all the time for all kinds of serious work, but for such you’ll have to consult the serious authors; what I can say myself, from working out the code to follow, is that the subject offers a fun playground plus the most primitive form of the pun between meaning and mechanism.

You’re encouraged to read with this article’s code cloned and ready