February 22, 2016 by Chris on Web Bookmarks

Bookmarks for February 22nd

February 21, 2016 by Chris on Web Bookmarks

Bookmarks for February 20th through February 21st

These are my links for February 20th through February 21st:

February 6, 2016 by Chris on Web Bookmarks

These are my links for February 5th through February 6th:

February 3, 2016 by Chris on Web Bookmarks

Why We Use Om, and Why We’re Excited for Om Next | The CircleCI Blog –
EK Theater — Thank You, But Our Princess is in Another Castle – <blockquote>Theater company comprised of students that retells classical stories using
live video games in a form of digital puppetry.</blockquote>
Unlimited Personalized Lessons from Knewton – <blockquote>Get the best personalized lessons to help with Math, English, Biology, History, and more, for free. It’s like studying with the world’s smartest tutor whenever and wherever you need.</blockquote>
Intuition, Details and the Bow/Arrow Metaphor | BetterExplained – <blockquote>My favorite analogies explain a thought and help you explore deeper truths. Here's a metaphor that captures my stance on learning: * Rote details are arrows,</blockquote>
Chrome Console APIs you’re probably not using yet –

February 2, 2016 by Chris on Web Bookmarks

These are my links for February 1st through February 2nd:

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