The unwind property for programs with bounded memory (Q1067771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The unwind property for programs with bounded memory |
scientific article; zbMATH DE number 3930320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The unwind property for programs with bounded memory |
scientific article; zbMATH DE number 3930320 |
Statements
The unwind property for programs with bounded memory (English)
0 references
1985
0 references
For programs that can access unbounded memory (e.g., flowchart programs with recursion on simple variable parameters), the 'unwind property' is equivalent to the 'truth-table property'. For programs restricted to bounded memory (e.g., flowchart programs with parameters recursion), the two properties are not equivalent in general. We recapitulate all known results, give new results, and establish conditions under which the two properties are equivalent for program with bounded memory.
0 references
definability by programs
0 references
logics of programs
0 references
program schemes
0 references
unbounded memory
0 references
flowchart programs
0 references
recursion
0 references
unwind property
0 references
truth-table property
0 references
0 references
