Talk:Clean (programming language)

Might want to include how it's one of the most efficient languages in calculating the Ackermann Function. [1] 70.111.251.203 14:54, 7 March 2006 (UTC)[reply]

I see this Fibonacci example often when people try to show off some language's features. But this function is terribly slow! It takes 2^n steps to compute the nth number. It would be enlightening for those who are just starting to look at this language if someone included an actually usable Fibonacci function implementation. (Yes, I know that Fibonacci numbers can be calculated in one step with a single formula, but here I mean an implementation that is usable for any number series in which x_n can be calculated as a function of x_{n-1} and x_{n-2}).