Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^2: The Ackermann Function

by gjb (Vicar)
on Jun 20, 2006 at 19:26 UTC ( #556515=note: print w/replies, xml ) Need Help??

in reply to Re: The Ackermann Function
in thread The Ackermann Function

I'm afraid this doesn't make sense to me. Are you suggesting that the Ackermann function should simply not be computed if the conditions for branch 3 hold? That would imply that one can only compute A(0, i) and A(i, 0), which is not particularly interesting.

I may miss your point, but I'd be a bit surprised if FSMs would be useful in this context. Can you show us what you have in mind?

Just my 2 cents, -gjb-

Replies are listed 'Best First'.
Re^3: The Ackermann Function
by NetWallah (Abbot) on Jun 21, 2006 at 01:28 UTC
    Oh - I beg to differ - His Noodly Appendage, the FSM is relevent in EVERY context !

         "For every complex problem, there is a simple answer ... and it is wrong." --H.L. Mencken

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://556515]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (5)
As of 2016-10-22 12:18 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (294 votes). Check out past polls.