Solving SAT via Positive Supercompilation(hirrolot.github.io)

138 points by Hirrolot 2 years ago | 29 comments

The Halting Problem is a terrible example of NP-Harder(buttondown.com)

87 points by BerislavLopac 1 year ago | 92 comments

Open Problems in Computational geometry(topp.openproblem.net)

80 points by nill0 1 year ago | 12 comments

Quantum Advantage for NP Approximation(scottaaronson.blog)

79 points by apsec112 2 years ago | 31 comments

SAT Solver Etudes I(philipzucker.com)

36 points by mathgenius 1 year ago | 12 comments

Why Haskell?(gtf.io)

387 points by mesaoptimizer 2 years ago | 533 comments

A long personal essay arguing why Haskell is a practical, productive language for building real software like web servers, covering fewer mistakes and easier reasoning.