August 1973 - Vol. 16 No. 8
Features
A learning program which plays partnership dominoes
A learning program has been written in BASIC to play four-player partnership dominoes. Because dominoes is a game of incomplete information, the program uses somewhat…
Fen—an axiomatic basis for program semantics
A formal system is presented which abstracts the notions of data item, function, and relation. It is argued that the system is more suitable than set theory (or its…
Petri nets and speed independent design
Petri nets are investigated as one method of modeling speed independent asynchronous circuits. A study of circuit realizations of Petri nets leads to a demonstration of…
Inductive methods for proving properties of programs
There are two main purposes in this paper: first, clarification and extension of known results about computation of recursive programs, with emphasis on the difference…
On the capabilities of while, repeat, and exit statements
A well-formed program is defined as a program in which loops and if statements are properly nested and can be entered only at their beginning. A corresponding definition…
A generalization of AVL trees is proposed in which imbalances up to &Dgr; are permitted, where &Dgr; is a small integer. An experiment is performed to compare these trees…