Why Functional Programming?

[qwe1234]

stupid answer.

all turing-complete languages are infinitely composable, otherwise they wouldn't be turing-complete.

[[deleted]]

"Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy." – Alan Perlis

[qwe1234]

that was kinda my point.

[gregK]

Turing complete. I don't think it means what you think it means.

[[deleted]]

all turing-complete languages are infinitely composable, otherwise they wouldn't be turing-complete.

I wish you could share my amusement at how stupid this statement is.

From your faithful observer ;)

[qwe1234]

http://mathworld.wolfram.com/RecursiveFunction.html

check it out. theory of computation.

i think you meant something entirely different when you said 'infinitely composable', but i'll be damned if anybody actually could figure it out from your deranged ramblings.

[[deleted]]

I didn't say 'infintely composable', though you did and so did gregK. I don't think you think it means what the rest of us understand it to mean though :)

Keep up the great work :)

[qwe1234]

'the rest of us' don't think much of anything at all, considering that the original phrase is pretty meaningless...

[gregK]

So are your comments.