SAT can be solved surprisingly quickly via superposed bools on Interaction Nets (gist.github.com) 6 points by LightMachine 2y ago ↗ HN
[–] edwintorok 2y ago ↗ The description of interaction nets sounds a bit like hash-consing, with some extra optimisations.
1 comment
[ 4.5 ms ] story [ 9.4 ms ] thread