Quanta: turn proofs into checkable puzzles
John Pavlus profiles Marijn Heule's work on SAT-based proof search: translate a statement into a tightly constrained logical problem, let a solver search, then check the resulting proof. It is a valuable counterpoint to fluent model output: a proof can be far too long to read line by line and still be mechanically checkable. The piece is an expert interview, not a benchmark of LLM capability.
Source 1 of 1
Quanta Magazine
quantamagazine.org
John Pavlus profiles Marijn Heule's work on SAT-based proof search: translate a statement into a tightly constrained logical problem, let a solver search, then check the resulting proof.
Open originalSummary
It is a valuable counterpoint to fluent model output: a proof can be far too long to read line by line and still be mechanically checkable. The piece is an expert interview, not a benchmark of LLM capability.
- 01Quanta Magazine