Topics /

Math & Algorithms

The most popular blog posts about math & algorithms on Hacker News. 50 posts.

2009
9

Beautiful plots of roots of polynomials

Click on the picture for bigger view. Roots of quadratic polynomials are in grey; roots of cubics are in cyan; roots of quartics are in red and roots of quintics are in black. The horizontal axis of symmetry is the real axis; the vertical axis of symmetry is the imaginary axis. The big hole in the middle is centered…

12

The New Science of Causation

It seems like each new day brings another one of those headlines: regular sleep “linked to” life expectancy, playing video games “associated with” surgical prowess, bullies “at risk” of becoming criminals, and “does breastfeeding reduce a baby’s blood pressure?” (the old rhetorical question gambit). Sometimes the…

13

SciPy - the embarrassing way to code

I’ve programmed in many languages before, indeed I’ve spent at least a year working in Basic, C, C++, C#, java, assembler, modula-2, powerhouse and prolog. One thing I’ve never done before is Matlab, well except a few basic exercises for some course I did way back. A couple of years ago I started using python and more…

22

Functional Geometry

Peter Henderson wrote an article about a method to describe pictures with functional programs. I've implemented it in Lisp. An updated version of the article uses curves and different shapes and has some references to other applications for this method, like "An Algebra of Music".

28

A Life that Added Up to Something: Paul Erdos (1996)

WASHINGTON - One of the most extraordinary minds of our time has "left." "Left" is the word Paul Erdos, a prodigiously gifted and productive mathematician, used for "died." "Died" is the word he used to signify "stopped doing math." Erdos never died. He continued doing math, notoriously a young person's field, right…

29

The Busy Beaver Problem

Busy Beaver puts another one on the Turing Machine's tape (image from the book The New Turing Omnibus). The busy beaver problem is a fun theoretical computer science problem. Intuitively, the problem is to find the smallest program that outputs as many data as possible and eventually halts. More formally it goes…