June 1, 2016 by Chris on Web Bookmarks

Bookmarks for May 31st through June 1st

These are my links for May 31st through June 1st:

Hacking through a Straw (Pivoting over DNS) | Strategic Cyber LLC –
VPN over DNS — #_shellntel –
C reference – cppreference.com –
Essential C (2003) [pdf] | Hacker News –
scottrogowski/code2flow: Turn your Python and Javascript code into DOT flowcharts –
Python Call Graph — Python Call Graph 1.0.1 documentation –
The Path to Rust :: Jon Gjengset – <blockquote>About six months ago, I started my first large-scale Rust-based project.I’d dabbled with the language in its early days, but back then it was adifferent beas…</blockquote>
Why You Will Marry the Wrong Person | Hacker News –

May 26, 2016 by Chris on Web Bookmarks

Bookmarks for May 26th

May 25, 2016 by Chris on Web Bookmarks

Bookmarks for May 24th through May 25th

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

May 14, 2016 by Chris on Web Bookmarks

Bookmarks for May 14th

May 13, 2016 by Chris on Web Bookmarks

Bookmarks for May 12th through May 13th

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

GitHub – alexjc/neural-doodle: Turn your two-bit doodles into fine artworks with deep neural networks, generate seamless textures from photos, transfer style from one image to another, perform example-based upscaling, but wait… there’s more! (An impleme –
Overview — caravel documentation –
GoAccess – Visual Web Log Analyzer –
A Farewell to FRP | Hacker News –
models/syntaxnet at master · tensorflow/models · GitHub – <blockquote>models – Models built with TensorFlow</blockquote>

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