Talk:Recursive language

From Wikipedia, the free encyclopedia

Socrates This article is within the scope of the WikiProject Philosophy, which collaborates on articles related to philosophy. To participate, you can edit this article or visit the project page for more details.
??? This article has not yet received a rating on the quality scale.
??? This article has not yet received an importance rating on the importance scale.

[edit] Example

I think that what's missing from this page is an example of a recursive language.

(a^n)(b^n)(c^n) is recursive. 128.84.152.179 17:39, 8 November 2006 (UTC)
Hopcroft & Ullman (1979 p.390) state that  L = \{a^n b^n c^n | n \geq 1 \} is indexed. So while it is true that it's recursive, this isn't an example that's particularly unique to recursive languages. –jonsafari 22:22, 8 November 2006 (UTC)

[edit] Attempt to merge

For anyone keeping this article on their watchlist: there is currently an attempt at merging a number of articles on (non-)recursive/(un)decidable/(un)computable sets/languages/decision problems into a single, thorough article. The experiment currently sits at Recursive languages and sets. Comments are very welcome. Pichpich (talk) 00:43, 21 February 2008 (UTC)