SAT can be solved surprisingly quickly via superposed bools on Interaction Nets | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

		SAT can be solved surprisingly quickly via superposed bools on Interaction Nets (gist.github.com)
		6 points by LightMachine on Jan 9, 2024 \| hide \| past \| favorite \| 1 comment

edwintorok on Jan 10, 2024 [–]

The description of interaction nets sounds a bit like hash-consing, with some extra optimisations.

Join us for AI Startup School this June 16-17 in San Francisco!
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact