Microprogramming has evolved since its introduction in 1951 by Maurice Wilkes. The most significant change that has taken place is the recent growth of interest in user microprogramming. However, user microprogramming is a difficult task because of various complex and intricate features of the host processors. A microprogrammer must be...
A tour of a graph (digraph, or sequential machine) is a sequence of nodes from the graph such that each node appears at least once and two nodes are adjacent in the sequence only if they are adjacent in the graph. Finding the shortest tour. of a graph is known...
A general model of interactive problem solving is described. The model views interactive problem solving to be the product of cooperating subsystems. The operative subsystem selectively attends to and manipulates problem relevant information in search of a solution. The descriptive subsystem is capable of interpreting this behavior and of discussing...
An operator calculus for transforming assignment statements, loops, and choice constructs into equation-of-state expressions is shown to be powerful enough to synthetically execute a given computer program and its test data. A demonstration of the program is equivalent to applying an operator formalism to the equation-of-state in order to reduce...
G. Spencer Brown's book Laws of Form has been enjoying a vogue among social and biological scientists. Proponents claim that the book introduces a new logic ideally suited to their fields of study, and that the new logic solves the problems of self-reference. These claims are false. We show that...
Recently several simply computed graph theoretic measures of computer program complexity, testing and unstructuredness have been proposed. Most of them are based on a static analysis of the program graph. One of the best known and most widely accepted is the cyclomatic number. Another is the number of knots, or...
This monograph presents a proof grammar for a formal language containing property symbols of every finite type. The proof grammar is thus applicable to any finite level higher-order logic.
The unique features of this system are: first, its mode of presentation as a recursive discourse grammar rigorously constructed from the...
Local stability seems to imply global stability for population models. To investigate this claim, we formally define a population model. This definition seems to include the one-dimensional discrete models now in use. We derive a necessary and sufficient condition for the global stability of our defined class of models. We...
A graph fold is the special case of a graph homomorphism where the two identified vertices are both adjacent to a common vertex. Like homomorphisms, folds are related to the chromatic number and we obtain an Interpolation Theorem for folds. If X(G) = n, then G is absolutely n-chromatic if...
Context-free grammars with graph control provide a general framework for the various types of context-free grammars with regulated rewriting. The vertices or edges of the directed graph are labeled with the productions of the grammar. The only strings in the language generated by the grammar are those whose derivations correspond...