November 2, 2015 by Chris on Web Bookmarks

Bookmarks for November 2nd

October 12, 2015 by Chris on Web Bookmarks

Bookmarks for October 12th

Filmmaking Tutorial: Part 2, Get the most out of your DSLR on Vimeo – <blockquote>High-end cinematic images on low-end DSLRs. This video goes very in-depth into how the DSLR works – I cover everything you need to know about formats, codecs,…</blockquote>
Zombie by assaf –
Labs | FoxType – <blockquote>Hey, how are you?</blockquote>
ferd.ca -> The Little Printf –

August 29, 2015 by Chris on Web Bookmarks

These are my links for August 26th through August 29th:

The Dictionary of Obscure Sorrows –
Chip – I made this today while experimenting with cellular automata parameters, and I found it uniquely beautiful. After a while the patterns stabilise and start to look like a kind of constantly-moving circuit diagram. I call it Chip. The source is on GitHub if you're that way inclined.
SIMD in Rust | Huon on the internet –

August 22, 2015 by Chris on Web Bookmarks

These are my links for August 19th through August 22nd:

August 13, 2015 by Chris on Web Bookmarks

These are my links for August 12th through August 13th:

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