1
Meditations on Moloch (2014)
I. Allen Ginsberg’s famous poem on Moloch:What sphinx of cement and aluminum bashed open their skulls and ate up their brains and imagination? Moloch! Solitude! Filth! Ugliness! Ashcans and u…
Most cited
Posts that commenters keep linking to, ranked by how many different people have cited them in Hacker News comments. 36 posts.
2
3
Solving Every Sudoku Puzzle (2006)
Every square has exactly 3 units and 20 peers. For example, here are the units and peers for the square C2 :
4
Exponential Economist Meets Finite Physicist (2012)
[ An updated treatment of some of this material appears in Chapter 2 of the Energy and Human Ambitions on a Finite Planet (free) textbook, also mirrors a 2022 article in Nature Physics . . ]
5
6
Using spaced repetition systems to see through a piece of mathematics
By Michael Nielsen, January 2019
7
Quantum Computing for the Curious
Presented in an experimental mnemonic medium that makes it almost effortless to remember what you read
8
Warning Signs in Experimental Design and Interpretation (2007)
When an experimental study states "The group with treatment X had significantly less disease ( p = 1%)", many people interpret this statement as being equivalent to "there is a 99% chance that if I do treatment X it will prevent disease." This essay explains why these statements are not equivalent. For such an…
9
A fast alternative to the modulo reduction (2016)
Suppose you want to pick an integer at random in a set of N elements. Your computer has functions to generate random 32-bit integers, how do you transform such numbers into indexes no larger than N? Suppose you have a hash table with a capacity N. Again, you need to transform your hash values (typically 32-bit ……
10
Viktor T. Toth
This page contains a JavaScript calculator of Hawking radiation and other parameters of a Schwarzschild black hole.
11
12
Visual Information Theory (2015)
I love the feeling of having a new way to think about the world. I especially love when there’s some vague idea that gets formalized into a concrete concept. Information theory is a prime example of this.
13
Why Do Buses Bunch?
Created by Lewis Lehe (of Setosa and UC Berkeley Trans. Eng. ) with design and art by Dennys Hess . Thanks to Ian Johnson for good advice. Tools: d3 , Angular Material , Coffeescript , Browserify , Gulp and Five-Hour Energy Drink .
14
Going Critical
Learn how things spread with playable simulations
15
Common statistical tests are linear models
By Jonas Kristoffer Lindeløv ( blog , profile ). Last updated: 28 June, 2019 (See changelog ). Check out the Python version and the Twitter summary .
16
17
18
Everything Is Correlated
Anthology of sociology, statistical, or psychological papers discussing the observation that all real-world variables have non-zero correlations and the implications for statistical theory such as ‘null hypothesis testing’.
19
Time Travel (2006)
Last time we talked about free will, superintelligent predictors, and Dr. Evil planning to destroy the earth from his moon base. Today I'd like to talk about a more down-to-earth topic: time travel. The first point I have to make is one that Carl Sagan made: we're all time travelers—at the rate of one second per…
20
Eigenvectors from eigenvalues
Peter Denton, Stephen Parke, Xining Zhang, and I have just uploaded to the arXiv the short unpublished note “Eigenvectors from eigenvalues”. This note gives two proofs of a general eige…
21
New pathfinding algorithm
New pathfinding algorithm Oxyd Last week we mentioned the change to make biters not collide with each other, but that wasn’t the only biter-related update we released this past week. Somewhat coincidentally, this week’s updates have included something I’d been working on for a few weeks before – an upgrade to the…
22
Knuth on Huang's Sensitivity Proof: “I've got the proof down to one page” [pdf]
The Sensitivity Conjecture, which I blogged about here, says that, for every Boolean function f:{0,1}n→{0,1}, the sensitivity of f—that is, the maximum, over all 2n input strings x∈{0,1}n, of…
23
A proof that Unix utility sed is Turing complete
Many people are surprised to learn that `sed`, a seemingly simple text filtering program, is actually Turing complete. This realization prompts the question: how can a text processing utility achieve such computational power? The answer lies in sed's fundamental operations. Essentially, sed functions as a miniature...
24
Viewing Matrices and Probability as Graphs
Today I'd like to share an idea. It's a very simple idea. It's not fancy and it's certainly not new. In fact, I'm sure many of you have thought about it already. But if you haven't—and even if you have!—I hope you'll take a few minutes to enjoy it with me. Here's the idea: Every matrix corresponds to a graph. So…
25
Cache Eviction: When Are Randomized Algorithms Better Than LRU? (2014)
Once upon a time, my computer architecture professor mentioned that using a random eviction policy for caches really isn't so bad. That random eviction isn't bad can be surprising — if your cache fills up and you have to get rid of something, choosing the least recently used (LRU) is an obvious choice, since you're…
26
Alpha Compositing
Interactive article explaining alpha compositing concepts.
27
Elliptic Curve Cryptography Explained
Fang-Pen Lin's blog about programming
28
A generalised solution to distributed consensus
A generalised solution to distributed consensus Howard & Mortier, arXiv’19 This is a draft paper that Heidi Howard recently shared with the world via Twitter, and here’s the accompanying …
29
30
Real-world dynamic programming: seam carving
Dynamic programming has a reputation as a technique you learn in school, then only use to pass interviews at software companies. Indeed, most developers do not regularly work on problems where dynamic programming is needed. Ultimately, dynamic programming is a technique for efficiently solving problems that can be…