The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.
    /==!/==atoi=@@@-@-----#
    |   |
    |   | [j]{i} -> {A(i,j)}, where A is the Ackermann function
    |   |       /=========\!==\!====\   ** recursion **
 $,@/>,@/==ack=!\?\<+#    |   |     |   A(0,j) -> j+1
  j   i           \<?\+>-@/#  |     |   A(i,0) -> A(i-1,1)
                     \@\>@\->@/@\<-@/#  A(i,j) -> A(i-1,A(i,j-1))
                       |  |     |
  {a}[ ][0]  #      #  |  |     |             /+<<<-\
  {0}[ ][a]  /-<<+>>\!=/  \=====|==!/========?\>>>=?/<<#  {a}[ ][0]
   (a > 0)   ?      ?           |   \<<<+>+>>-/           [a]{ }[a]
  [0][ ]{a}  \>>+<<-/!==========/
  [a][ ]{0}  #      #