31
Yacc is dead: An update
The draft of " Yacc is Dead " that David Darais and I posted on arXiv received some attention, so we'd like to share updates and feedback.
32
33
34
S. Cook: “This appears to be a relatively serious claim to have solved P vs NP.”
An email I was recently forwarded (a couple of steps removed) from Vinay Deolalikar from HP Labs:
35
You Don't Need Math Skills To Be A Good Developer - What About A Great One
Why everyday CRUD work needs little math, but search, machine learning, cryptography and other interesting fields need plenty.
36
37
Are you one of the 10% of programmers who can write a binary search?
There are some programming books that I’ve read from cover to cover repeatedly; there are others that I have dipped into many times, reading a chapter or so at a time. Jon Bentley’s 19…
38
Notation And Thinking
Does notation shape our thinking? Kenneth Iverson was a mathematician who is most famous for designing APL. This was the name of his programming language, and it cleverly stood for “A Program…
39
Maze Generation: Eller's Algorithm
Algorithms, circle mazes, hex grids, masking, weaving, braiding, 3D and 4D grids, spheres, and more!
40
Nobody Understands Probability
The goal of this post is to give an overview of Bayesian statistics as well as to correct errors about probability that even mathematically sophisticated people commonly make. Hopefully by the end …
41
Some fun mathematical puzzles
Explore research at Microsoft, a site featuring the impact of research along with publications, products, downloads, and research careers.
42
43
44
R.J. Lipton - A proof that P is not equal to NP
A serious proof that claims to have resolved the P=NP question. Vinay Deolalikar is a Principal Research Scientist at HP Labs who has done important research in various areas of networks. He also h…
45
Insanely deep fractal zoom
I was really into fractals in college (I know…) when I was making rave flyers (I know!) for a friend’s parties in Iowa (I know! I know! Shut up already!). Anywa
46
First Clay Millennium Prize goes to Grigoriy Perelman
Poincare official problem description
47
Do C compilers disprove Fermat's Last Theorem?
(You probably already have realized this.) The reason the compiler produced code that terminated was based upon the fact that the values being altered (i.e., a, b and c) within the “while” loop are never referenced again after the loop. But, once you added code which printed the resulting values it was forced to…
48
Regular Expression Matching in the Wild
The first two articles in this series, “ Regular Expression Matching Can Be Simple And Fast ” and “ Regular Expression Matching: the Virtual Machine Approach ,” introduced the foundation of DFA-based and NFA-based regular expression matching. Both were based on toy implementations optimized for teaching the basic…
49
Ask HN: How do you solve hard problems if you can't make incremental progress?
Ron Jeffries attempts to create a sudoku solver - here , here , here , here and here . (You really ought to read these articles. They are u...
50
Implementing Regular Expressions
This page collects resources about implementing regular expression search efficiently.
51
Chicago undergraduate mathematics bibliography
Somehow I became the canonical undergraduate source for bibliographical references, so I thought I would leave a list behind before I graduated. I list the books I have found useful in my wanderings through mathematics (in a few cases, those I found especially un useful), and give short descriptions and comparisons…