Publication
STOC 1974
Conference paper

Degrees of transutability and canonical tormp in ptohpam schemas-Part I

Download paper

Abstract

We define a measure of the generality of the control structure of a program schema. This uiposes a partial ordering on program schemas, and leads to a concept of the "difficulty" of a progranming problem. In this sense there exists a "hardest" flowchart program, recursive program etc. Some earlier proofs can also be sinplified and/or clarified by this approach.

Date

30 Apr 1974

Publication

STOC 1974

Authors

Resources

Share