Explore >> Select a destination
|
You are here 
|
www.msoos.org | ||
| | | | |
codingnest.com
|
|
| | | | | Before I started doing research, I saw SAT solvers as academically interesting but without practical uses ouside of other academic applications. I've since then changed my mind, and I want to change yours, because modern SAT solvers are neat, fast and almost criminally underused by the industry. | |
| | | | |
ochagavia.nl
|
|
| | | | | 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. | |
| | | | |
blog.jak-linux.org
|
|
| | | | | As you may recall from previous posts and elsewhere I have been busy writing a new solver for APT. Today I want to share some of the latest changes in how to approach solving. The idea for the solver was that manually installed packages are always protected from removals - in terms of SAT solving, they are facts. Automatically installed packages become optional unit clauses. Optional clauses are solved after manual ones, they don't partake in normal unit propagation. | |
| | | | |
ernest.oppet.it
|
|
| | | Link Summary of contributions Mathematical foundations for quantum mechanics (aged 22) Mathematics of ballistics & explosions (in the 30s when sensed war was looming) Analysis of the structure of self-replication which preceded the discovery of the structure of DNA Manhattan project Founded Game theory Building the ENIAC, the first digital computer Cellular automata Introduction "As... | ||
