/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 codingnest.com
Modern SAT solvers: fast, neat and underused (part 1 of N)- The Coding Nest
| | benjamincongdon.me
Solving the "Miracle Sudoku" in Prolog | Ben Congdon
5.2 parsecs away

Travel
| | Writing a solver for "Miracle Sudoku" puzzles in Prolog.
| | ochagavia.nl
The magic of dependency resolution | Adolfo Ochagavía
4.2 parsecs away

Travel
| | Dependency resolution is something programmers usually take for granted. Be it cargo, npm, or whatever package manager you use, no one is actually surprised when this black-box figures out, all by itself, the specific set of packages that should be installed. To me, though, it is a fascinating feat. It feels magical when a machine solves an abstract problem like that, with minimal input from me as a user! I was, therefore, delighted when the nice folks at Prefix.
| | www.jeremykun.com
P vs. NP, A Primer (And a Proof Written in Racket) | Math Programming
6.4 parsecs away

Travel
| | Decidability Versus Efficiency In the early days of computing theory, the important questions were primarily about decidability. What sorts of problems are beyond the power of a Turing machine to solve? As we saw in our last primer on Turing machines, the halting problem is such an example: it can never be solved a finite amount of time by a Turing machine. However, more recently (in the past half-century) the focus of computing theory has shifted away from possibility in favor of determining feasibility.
| | blog.roccosangellino.com
Setting up a web development machine
29.1 parsecs away

Travel
| When beginning to code, sometimes it can feel overwhelming to create your ideal setup. When starting your web development journey in HTML, CSS, and JavaScript, it is helpful to have a starting point for getting set up. With so many different language...