March 24, 2016 by Chris on Web Bookmarks

Bookmarks for March 24th

Why Procrastinators Procrastinate – Wait But Why –
The Search for the Perfect To-do List – <blockquote>Beware the to-do list rabbit hole. It starts off with one or two innocent reminders and ends up with you tumbling down a long hole of procrastination in search of the perfect system. After many years of trying different software I’m glad to say that I’m finally climbing back out of the hole wearing a rather dashing Cheshire Cat pelt.</blockquote>
Home:Stencila –
Advanced Linux Programming – book with free PDF (2001) | Hacker News –

March 22, 2016 by Chris on Web Bookmarks

Bookmarks for March 22nd

Artificial Intelligence and Startups : Some Starting Points for Deep Learning and RNNs –
Python, Machine Learning, and Language Wars – <blockquote>This is the personal website of a data scientist and machine learning enthusiast with a big passion for Python and open source. Born and raised in Germany, now living in East Lansing, Michigan.
</blockquote>
Kraft Reveals Revamped Mac and Cheese, 50M Boxes Later | Hacker News –

March 22, 2016 by Chris on Web Bookmarks

These are my links for March 21st through March 22nd:

March 21, 2016 by Chris on Web Bookmarks

March 20, 2016 by Chris on Web Bookmarks

These are my links for March 19th through March 20th:

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