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 –

September 27, 2016 by Chris on Web Bookmarks

Bookmarks for September 27th

September 16, 2016 by Chris on Web Bookmarks

Bookmarks for September 15th through September 16th

These are my links for September 15th through September 16th:

April 2, 2016 by Chris on Web Bookmarks

Bookmarks for April 2nd

March 30, 2016 by Chris on Web Bookmarks

Bookmarks for March 30th

Table for one: How to play board games without a group | Ars Technica – <blockquote>From solo games to apps and virtual tabletops, there's a world of options.</blockquote>
Evolution of Webdesign –
What can a technologist do about climate change? A personal view. –
GitHub – lukebuehler/CShell: A simple, yet powerful, C# scripting IDE and REPL –
C# REPL | Mono –
A Large Dataset of Object Scans –
Refurbishing A 1927 Switchboard, Part 1: Wiring –
expired at the daytona 500 | Redlights and Redeyes –
EC2 for Poets –
TensorFlow for Poets « Pete Warden’s blog –
Beyond the sea | Andy Woodruff –

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