Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 9,921 of 10,432    |
|    Richard Fateman to S.K.R. de Jong    |
|    Re: Symbolic systems and Ackermann funct    |
|    24 Jun 18 15:38:00    |
      From: fateman@gmail.com              On Sunday, June 24, 2018 at 1:07:30 PM UTC-7, S.K.R. de Jong wrote:       snip        However, a straightforward Lisp implementation, similar to        > the one above, would choke trying to compute A(4, 4). Hence my question.              So your question is, does any CAS implement Knuth's "up arrow" notation.              (a) Not to my knowledge, but it is possible.       (b) It appears that it is used in order to return a compact answer from an       iterative version of Ackermann's function.       (c) It is probably rather low interest otherwise.       (d) If you are interested in it, and as you say, know how to use it "by hand"       then you should be able to simulate whatever it is you do by hand, by computer       program. In that case, it may be useful to have a CAS, because you can       manipulate forms like        uparrow(a,b).              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca