## Search

Now showing items 1-10 of 15

#### The Requirements for Effective Hardware Description Languages

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1975), CS75011-R

The design of hardware description languages (HDL's) is considered with respect to their structural and functional properties rather than their syntactic forms. The contents of an idealized HDL are contrasted with those ...

#### Three Papers on the Completeness Properties of Abelian Semi groups and Groups

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74008-R

The three papers presented here all arise from recent research into sets of operators which are sufficient to define a horizontal microlanguage for a computer and which are (in some undefined sense) natural for human ...

#### Functionally Complete Machines

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73005-R

This paper defines a functionally complete machine as a machine which is capable of evaluating every two place function over its data space. Necessary conditions on memory size for completeness are developed. These conditions ...

#### Some Classical Mathematical Results Related to the Problems of the Firmware/Hardware Interface

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1975), CS75015-R

The paper reviews the Shannon and Reed-Muller Decomposition Theorems and notes the relationship of the former to machine instruction set. It hypothesizes an instruction set based on Galois field operations and applies ...

#### A Complete Horizontal Microlanguage

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73002-R

This paper defines a data space whose points are trees with leaves which are [name,value] pairs. Over this space a substitution operator S (meaning informally "in x for y put z") is formally defined. Taken together with ...

#### A Topological Model of the Data Space for a Block Structured Language

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73004-R

A space X is defined, the points of which are trees which possess a unique name property. A topology is defined for X based upon partial order. The topology is shown to be reasonably natural relative to the rationals. The ...

#### Microprogrammable Cellular Automata

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73006-R

This paper reports research into cellular automata with two binary inputs, two binary outputs, and an octal control variable. A set of control variables is chosen and it is shown that any function of three variables can ...

#### Divided Difference Methods for Finite Fields

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1975), CS75018-R

The Reed-Muller Decomposition Theorem is shown to be a special case of a theorem of Newton. Divided difference methods are developed for the general case of any finite field. The Newton Interpolation Theorem is proved ...

#### A Markov Model of Cyclic Structured Programs

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1977), CS77002-R

The paper defines a class of flow graphs which possess neither absorbing nor transient states. It gives a necessary and sufficient condition that any transition matrix associated with such a program be primitive. With a ...

#### A Markov Model of Certain Structured Programs

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1976), CS76004-R

The paper is concerned with modeling the run time behavior of a certain class of programs. Each program, represented by its flowgraph, is built up from one-in/one-out constructs (after the manner of Dijkstra). The programs ...