The unwind property for programs with bounded memory

The unwind property for programs with bounded memory

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 parameterless recursion), the two propert...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1985-11, Vol.21 (5), p.233-238
1. Verfasser: Kfoury, A.J.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer programming
Computer science
control theory
systems
Definability by programs
Exact sciences and technology
Information processing
logics of programs
program schemes
Theoretical computing
Theory
unwind property
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 parameterless 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.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(85)90090-0