| Display title | Structured program theorem |
| Default sort key | Structured program theorem |
| Page length (in bytes) | 1,202 |
| Namespace ID | 0 |
| Page ID | 305037 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2635326 |
| Central description | theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration |
| Page views in the past 30 days | 161 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Mukkakukaku (talk | changes) |
| Date of page creation | 01:58, 15 August 2011 |
| Latest editor | MathXplore (talk | changes) |
| Date of latest edit | 05:19, 21 February 2022 |
| Total number of edits | 9 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden category (1) | This page is a member of a hidden category:
|
| Transcluded templates (2) | Templates used on this page:
|
| Wikidata entities used in this page | |
