Teaching a Minimalist Machine to Discover Recursive Programs for Arithmetic

Excerpt

arXiv:2610.06304v1 Announce Type: new Abstract: Humans can often acquire and synthesize complex, recursive concepts from minimal experience. Leveraging cognitive insights, we propose the Minimalist Machine, a framework for inductive program synthesis designed to model such conceptual learning. The system uses a compact relational subset of Prolog: Programs are searched within a fixed schema of body-free facts and two-body conjunctive Horn clauses. Recursion is not defined by a dedicated metarule