June 29, 2017 by Chris on Web Bookmarks

Bookmarks for June 29th

November 30, 2016 by Chris on Web Bookmarks

Bookmarks for November 30th

June 27, 2016 by Chris on Web Bookmarks

These are my links for June 24th through June 27th:

February 20, 2016 by Chris on Web Bookmarks

These are my links for February 18th through February 20th:

Where did all the HTTP referrers go? (2013) | Hacker News –
Making Your Code Citable · GitHub Guides –
Zenodo –
The Winnower | Now I am become DOI, destroyer of gatekeeping worlds –
555 timer teardown: inside the world’s most popular IC – Current mirror circuit. The current on the right copies the current on the left.
A common use of a current mirror is to replace resistors. As explained earlier, resistors inside ICs are both inconveniently large and inaccurate. It saves space to use a cur
On Marrying the Wrong Person | The Book of Life – <blockquote>On Marrying the Wrong Person – The Book of Life is the 'brain' of The School of Life, a gathering of the best ideas around wisdom and emotional intelligence.
</blockquote>

January 30, 2016 by Chris on Web Bookmarks

These are my links for January 29th through January 30th:

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