January 15, 2016 by Chris on Web Bookmarks

Bookmarks for January 15th

December 24, 2015 by Chris on Web Bookmarks

Bookmarks for December 23rd through December 24th

These are my links for December 23rd through December 24th:

December 7, 2015 by Chris on Web Bookmarks

How Your Brain Decides Without You – Issue 19: Illusions – Nautilus – <blockquote>Princeton’s Palmer Field, 1951. An autumn classic matching the unbeaten Tigers, with star tailback Dick Kazmaier—a gifted passer,…</blockquote>
Nylas – The next-generation email platform. – <blockquote>Nylas provides a modern developer
platform for email, contacts, and calendar. Stop fighting old protocols,
and start building great products</blockquote>
Examples – Plottable.js –
Vega: A Visualization Grammar –
Getting Started | d3.compose –

November 16, 2015 by Chris on Web Bookmarks

Anyone Can Learn To Code an LSTM-RNN in Python (Part 1: RNN) – i am trask –
The “bicameral mind” 30 years on: a critical reappraisal of Julian Jaynes’ hypothesis –
NIMH » Antipsychotics: Taking the Long View – <blockquote>Antipsychotics help people through the crisis of acute psychosis, but the long-term management of chronic mental illness is another matter. It appears that what we currently call “schizophrenia” may comprise disorders with quite different trajectories. For some people, remaining on medication long-term might impede a full return to wellness. For others, discontinuing medication can be disastrous.</blockquote>
Does Long-Term Treatment of Schizophrenia With Antipsychotic Medications Facilitate Recovery? –

October 17, 2015 by Chris on Web Bookmarks

These are my links for October 16th through October 17th:

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