"In fact, Turing completeness can be achieved with as few as two intrinsics", are you referring to the SK combinators, or in terms of the intrinsics in your language?
Yes, essentially. Things are slightly different for the concatentive calculus, though. Traditional combinator calculus is a restriction of the lambda calculus. SK calculus does not operate on a stack.
