R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.

In this lecture we discuss a type of computer organization which is based upon the concept of operation sequencing being controlled by operand availability. Such sequencing differs radically from current computer organizations in which the sequencing is determined by an explicit or implicit ordering of the instructions which is controlled through an instruction counter which specifies the next instruction to be performed. We will discuss a particular type of data sequenced computer called "configurable computers" [7]. Closely related types of machines have subsequently also been proposed and studied by others [3, 11, 10, 9].