Revision as of 22:30, 30 January 2008 edit Dcoetzee (talk \| contribs) 37,529 edits →confusion PCs are not FSMs ← Previous edit		Revision as of 00:43, 21 February 2008 edit undo Pichpich (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers, Pending changes reviewers, Rollbackers 90,527 edits →Attempt to merge: new section Next edit →
Line 284: I don't understand this idea. What does it mean to decide a language? [[User:Unfree\|Unfree]] ([[User talk:Unfree\|talk]]) 16:32, 30 January 2008 (UTC) :To decide whether a given string is in the language or not. --[[User:Trovatore\|Trovatore]] ([[User talk:Trovatore\|talk]]) 20:11, 30 January 2008 (UTC) == 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. [[User:Pichpich\|Pichpich]] ([[User talk:Pichpich\|talk]]) 00:43, 21 February 2008 (UTC)

Talk:Computability theory (computer science): Difference between revisions