December 4, 2015 by Chris on Web Bookmarks

Bookmarks for December 4th

TrackMeNot –
ADNAUSEAM – Clicking Ads So You Don’t Have To –
Chris Martens – I investigate how to use mathematical tools, such as proof theory, to better understand and create interactive rule systems. I place an emphasis on games and computational creativity, but I am broadly interested in modeling computational and scientific sys
10 Top DAW Controller Apps : Ask.Audio –
SEORCH – OnPage SEO Tool – Search Engine Optimization –
An Introduction to Content Security Policy – HTML5 Rocks – <blockquote>Mitigate the risk of cross-site scripting attacks by whitelisting trusted origins with a Content Security Policy.</blockquote>
The Alzheimer Pandemic: Is Paracetamol to Blame? – <blockquote>
</blockquote>

December 2, 2015 by Chris on Web Bookmarks

Bookmarks for December 1st through December 2nd

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

November 25, 2015 by Chris on Web Bookmarks

November 23, 2015 by Chris on Web Bookmarks

These are my links for November 21st through November 23rd:

September 27, 2015 by Chris on Web Bookmarks

These are my links for September 26th through September 27th:

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