[firethief]

Let's make that into a complete language:

ka := the S combinator

ku := the K combinator

Done. Now kakuku is as expressive as any other Turing-complete language.

( https://en.m.wikipedia.org/wiki/SKI_combinator_calculus )