From: fateman@gmail.com   
      
   On Saturday, June 23, 2018 at 5:34:27 PM UTC-7, S.K.R. de Jong wrote:   
   > Are there any symbolic systems that can deal with Ackermann   
   > functions computations?   
      
   Can you be more specific on what you mean by "deal"?   
      
   It is not especially symbolic. The obvious definition   
   usually causes problems   
   with stack space because it is a heavily-recursive function.   
      
   Symbolic systems also use stack space, so they suffer the   
   same fate.   
      
      
    Here's a definition in lisp.   
      
   (defun ackermann (x y)   
     (cond ((= y 0) 0)   
           ((= x 0) (* 2 y))   
           ((= y 1) 2)   
           (t (ackermann (- x 1) (ackermann x (- y 1))))))   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)