According to LessWrong contributor MathMart, finding computable mathematical models for logical systems is generally impossible. But there's a workaround: by allowing computer programs to revise their previous answers—so long as they eventually settle on stable outputs—almost-computable models can be constructed for any consistent first-order theory. The approach is demonstrated using set theory, where the author shows how to progressively add objects and constraints, systematically narrowing possible solutions until a valid model emerges.

Listen to this story

Hear this and more stories in a personalized audio briefing.

Open The Chonkerton