# Study of free monoids of the recursive S. Eilenberg.

Compared to the usual treatises on recursion (eg, Rogers H. "Computability and Undecidability." McGraw-Hill, New York) the book of Samuel Eilenberg & Calvin C. Elgot "Recursiveness" treats such matters to the General context of free monoids (with finite base) instead of functions or relations between (finite) powers of natural numbers. As the strike theoretical elegance (typical of S. Eilenberg), the generalization requires its own hard case with respect to numerical orthodox one, is then to wonder about the scope and usefulness of this generalization.

¨ What is the benefit of this approach?

-
That is an awfully open-ended question. A little too discussion-y for my taste. (The quality of the English also makes this post difficult for me to parse.) –  Todd Trimble Oct 8 '11 at 16:04
"The recursive Samuel Eilenberg" makes for a great title for a novel. –  Mariano Suárez-Alvarez Oct 8 '11 at 16:19
Almost any non-identity permutation of the words in the title of this question would make more sense than the original. Voting to close. –  David Loeffler Oct 8 '11 at 16:36
+1 Mariano. Or perhaps for a short story by Borges. –  Todd Trimble Oct 8 '11 at 22:59
Can anyone parse this and correct it? I've tried but everything becomes very cloudy near the end. And I still can't make sense of the (otherwise masterfully poetic) title. –  François G. Dorais Dec 25 '11 at 21:16