> ---Quote (Originally by K_Meinhard)---

> Hi all,

>

> has anybody seen this site:

> <

http://rosettacode.org/wiki/Ackermann_function> (http:

> //rosettacode.org/wiki/Ackermann_function%3E) ?

>

> How would the function look in TCC code? Which level of recursion is

> reached by TCC? Could we add it to the Rosetta code page?

>

> Best Regards,

>

> * Klaus Meinhard *

> <www.4dos.info>

> ---End Quote---

> Why would you want to do this? Ackerman's function (or to be precise

> </www.4dos.info>the Ackermann¨CP¨¦ter function) is know to all (ehem)

> people who've done anything with computability theory. It's value is

> to show that there exist recursive (one of the terms for computable

> aka Turing-computable, Markov-computable, lambda-computable, etc)

> functions that are not primitive-recursive (roughly a simpler,

> better behaved subclass).

>

> Being Hungarian, I of course take pride in knowing that P¨¦ter (this

> is her surname) is R¨®zsa P¨¦ter, an excellent 20th century Hungarian

> mathematician. She taught at the Hungarian university I went to, but

> I just missed her (she retired in '75 and died in '77). According to

> well-known anecdotes, in the 50-s she would bring back condoms from

> her foreign trips and distribute them to her students (these were

> impossible to obtain in Hungary at the time due to a state program

> of encouraged population growth).

>

>

>

>