| Display title | Recursively enumerable language |
| Default sort key | Recursively enumerable language |
| Page length (in bytes) | 4,709 |
| Namespace ID | 0 |
| Page ID | 215885 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Wikisleeper |
| Date of page creation | 16:45, 6 February 2024 |
| Latest editor | imported>Wikisleeper |
| Date of latest edit | 16:45, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language... |
