I'm coming to the view that NP-complete problems are harder to work with than tasks equivalent to the halting problem.
For the halting problem, you know you're never going to solve the general case. For NP-complete problems there's a slew of complex algorithms to explore.
Related Posts
I'm exploring how I show lists in my documentation. I like boxes for tidiness, but it's much less space efficient. Which do you prefer?
I should also survey how other sites handle this.
One month after configuring my VPS to reboot weekly, and I'm *still* finding services that aren't properly configured to start on boot.
I'm developing a newfound appreciation for tools like Chaos Monkey.
I've been impressed with code written by Fable in my testing:
Difftastic: found small optimisations in a hot loop I'd already profiled extensively. Helped me prototype Dijkstra to A* too (hard to find a good heuristic).
Garden: Found some real bugs in my simplistic typechecker.