| Display title | Structured program theorem |
|---|
| Default sort key | Structured program theorem |
|---|
| Page length (in bytes) | 30,299 |
|---|
| Namespace ID | 0 |
|---|
| Page ID | 1482138 |
|---|
| Page content language | en - English |
|---|
| Page content model | wikitext |
|---|
| Indexing by robots | Allowed |
|---|
| Number of page watchers | 71 |
|---|
| Number of page watchers who visited in the last 30 days | 2 |
|---|
| Number of redirects to this page | 5 |
|---|
| Counted as a content page | Yes |
|---|
| Wikidata item ID | Q2635326 |
|---|
| Local description | Theorem about a certain class of control-flow graphs |
|---|
| 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 | |
|---|
| Edit | Allow all users (no expiry set) |
|---|
| Move | Allow all users (no expiry set) |
|---|
| Page creator | Karlheg (talk | contribs) |
|---|
| Date of page creation | 18:59, 8 February 2005 |
|---|
| Latest editor | GreenC bot (talk | contribs) |
|---|
| Date of latest edit | 10:28, 17 October 2026 |
|---|
| Total number of edits | 253 |
|---|
| Recent number of edits (within past 30 days) | 1 |
|---|
| Recent number of distinct authors | 1 |
|---|
| Hidden categories (12) | This page is a member of 12 hidden categories (help):
|
|---|
| Transcluded templates (88) | Pages transcluded onto the current version of this page (help):
|
|---|
| Wikidata entities used in this page | |
|---|
