Some relationships between logics of programs and complexity theory
The authors study some interesting connections between (open) problems in comparative schematology and logics of programs, on one hand, and problems in complexity theory on the other hand. As an example, PSPACE\(=PTIME\) iff flow-diagrams with arrays are of the same computational power as recursive procedures.
scientific article; zbMATH DE number 4063081
scientific article