January 3, 2017 by Chris on Web Bookmarks

Bookmarks for January 2nd

The Lua VM, on the Web | Hacker News –
Interacting with code — Emscripten 1.36.14 documentation –
Effective learning: Twenty rules of formulating knowledge | SuperMemo.com –
About » Photo Class – I decided to create a quick introduction to photography class. The premise was simple: 30 lessons covering most of the basic subjects, assuming no prior knowledge, and with a focus on the practical over theoretical explanations.
SQL Transaction Isolation Levels Explained | Elliot Chance –
An Interactive Tutorial on Numerical Optimization –

December 27, 2016 by Chris on Web Bookmarks

Bookmarks for December 27th

December 6, 2016 by Chris on Web Bookmarks

Bookmarks for December 5th through December 6th

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

December 5, 2016 by Chris on Web Bookmarks

Bookmarks for December 4th through December 5th

These are my links for December 4th through December 5th:

November 13, 2016 by Chris on Web Bookmarks

Bookmarks for November 12th through November 13th

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

facebook-pixel-guide/README.md at master · adam-s/facebook-pixel-guide –
Trigger Happy – SERVICES THAT CAN BE MIXED TOGETHER
Currently the available services are (in alphabetic order):

Evernote Take notes, add events, store pictures, etc,
GitHub Source code hosting,
Instapush Instant notifications,
Pelican Blog generator,
Zero-allocation Trie Traversal « null program –
Video Encoding & Streaming Technologies | Fabio Sonnati on video delivery and encoding –
The 21 Documentaries from the 21st Century Everyone Should See | GQ –

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