February 3, 2016 by Chris on Web Bookmarks

Bookmarks for February 3rd

November 20, 2015 by Chris on Web Bookmarks

Bookmarks for November 20th

Detectify Labs –
Oh, Go Ahead. Overthink FizzBuzz. – Chalain – <blockquote>I gave the best programming interview answer I may have ever given last Friday. The interviewer hauled out FizzBuzz and asked me to solve it. It took me a minute to stop laughing. FizzBuzz is a brain-dead simple programming problem, used pretty much to tell if a developer has a pulse at all. It…</blockquote>
Joe Duffy – Asynchronous Everything – <blockquote>Joe Duffy's Blog | Adventures in the high-tech underbelly</blockquote>

October 14, 2015 by Chris on Web Bookmarks

RemObjects Silver | Elements –
Homemade synthetic aperture radar – Henrik’s Blog – <blockquote>Second version of the 6 GHz FMCW radar now with SAR images</blockquote>
Still Not Significant | Probable Error – <blockquote>What to do if your p-value is just over the arbitrary threshold for 'significance' of p=0.05? You don't need to play the significance testing game – there are better methods, like quoting the effect size with a confidence interval – but if you do, the rules are simple: the result is either significant or it…</blockquote>

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 –

May 15, 2015 by Chris on Web Bookmarks

These are my links for May 14th through May 15th:

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