3 ms·
> The Ackermann function grows extremely quickly (quicker than any primitive recursive function I believe) This is correct. It was basically invented to show t
by adrianN 16y ago
> The Ackermann function grows extremely quickly (quicker than any primitive recursive function I believe)
This is correct. It was basically invented to show that primitive recursion is not capable of computing every computable function.