Ackermann's function is recursive (equivalently, computable), but it is not primitive recursive. In fact, if we define f_k(n) = A(k,n) then for each k, f_kis primitive recursive. It is defined for all inputs; this shows that while every primitive recursive function is a total computable function, the converse is not true.