Theory: Difference between revisions
| Line 25: | Line 25: | ||
===Recursively-Enumerable Languages (Class [http://qwiki.stanford.edu/wiki/Complexity_Zoo:R#re RE])=== | ===Recursively-Enumerable Languages (Class [http://qwiki.stanford.edu/wiki/Complexity_Zoo:R#re RE])=== | ||
* Type 0 of the [[Chomsky Hierarchy]], a proper superset of CSL's | * Type 0 of the [[Chomsky Hierarchy]], a proper superset of CSL's | ||
* Recognized by [[Turing Machines]] | * Recognized by [[Turing Machines]] (ie, any 'yes' answer can be verified, but 'no' cases might not halt) | ||
===Recursive Languages (Class [http://qwiki.stanford.edu/wiki/Complexity_Zoo:R#r R])=== | ===Recursive Languages (Class [http://qwiki.stanford.edu/wiki/Complexity_Zoo:R#r R])=== | ||
* Decided by [[Turing Machines]] | * Decided by [[Turing Machines]] | ||
[[Category: CS GRE Prep]] | [[Category: CS GRE Prep]] | ||