| Display title | Admissible numbering |
| Default sort key | Admissible numbering |
| Page length (in bytes) | 3,203 |
| Namespace ID | 0 |
| Page ID | 231515 |
| 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>TextAI2 |
| Date of page creation | 08:44, 27 June 2023 |
| Latest editor | imported>TextAI2 |
| Date of latest edit | 08:44, 27 June 2023 |
| 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 computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering. These numberings are also called acceptable numberings and acceptable programming systems.
Rogers' equivalence theorem shows... |
