January 18, 2017 by Chris on Web Bookmarks

Bookmarks for January 18th

January 18, 2017 by Chris on Web Bookmarks

Bookmarks for January 17th through January 18th

These are my links for January 17th through January 18th:

Selecting a platform | MutanatuM –
localForage/localForage: ? Offline storage, improved. Wraps IndexedDB, WebSQL, or localStorage using a simple but powerful API. –
Ask HN: Have you ever worked on a product that was killed by technical debt? | Hacker News –

January 2, 2017 by Chris on Web Bookmarks

Bookmarks for January 2nd

TaxCloud: Free Internet Sales Tax Management –
The Developer Marketing Guide | Hacker News –
How I Write Tests – Made of Bugs –
Ask HN: How to learn new things better? | Hacker News –
What Scientific Term or Concept Ought to be More Widely Known? | Hacker News –
Three.js editor | Hacker News –
MakeHuman | Open source tool for making 3d characters – MAKEHUMAN IS…
…the free and open source software to create realistic 3d humans for:

Illustrations
Animations
Games
Zbrush/Mudbox sculpting

December 25, 2016 by Chris on Web Bookmarks

Bookmarks for December 24th through December 25th

These are my links for December 24th through December 25th:

Computer Science from the Bottom Up –
Computer Science from the Bottom Up (2013) | Hacker News – [2] – https://en.wikipedia.org/wiki/Common_Lisp#Syntax
Ask HN: What Are the Best Current Methods to Delete Yourself from the Internet? | Hacker News –
Abine Blur: passwords, payments, & privacy –
20 Composition Techniques That Will Improve Your Photos –

December 23, 2016 by Chris on Web Bookmarks

Bookmarks for December 23rd

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