"They are interesting because with just three initial functions (successor, constant and projection functions) closed under composition and primitive recursion, one can produce most computable functions studied in number theory (addition, division, factorial, exponential, etc.)."
Those functions compose into programs that halt (if I read the linked Wiki right). The LC encompasses those programs plus more programs, which cannot be shown to halt.