# 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)

## Filter Results

Displaying Results 1 - 25 of 41
• ### [Front cover]

Publication Year: 1961, Page(s): C1
| PDF (70 KB)

Publication Year: 1961, Page(s):vii - ix
| PDF (91 KB)
• ### Foreword

Publication Year: 1961, Page(s): iii
| PDF (25 KB)
• ### Preface

Publication Year: 1961, Page(s):v - vi
| PDF (114 KB)
• ### An application of linear programming to the minimization of Boolean functions

Publication Year: 1961, Page(s):3 - 9
Cited by:  Papers (9)
| | PDF (1095 KB)

A method is described for converting a boolean expression to a disjunctive normal equivalent (two level OR-AND circuit) which is minimal under some criterion presented in advance, as for example, the number of clauses or the number of literals (equivalently, the number of OR's or the number of OR's and AND's together). The method employs the integer linear programming algorithm developed by R. E. ... View full abstract»

• ### Minimal sums for Boolean functions having many unspecified fundamental products

Publication Year: 1961, Page(s):10 - 17
Cited by:  Papers (5)
| | PDF (1264 KB)

Many techniques have been developed for finding minimal sums and minimal products for Boolean functions. In all of these techniques, it is necessary to use either all of the fundamental products which must be included in the function and all of the unspecified fundamental products ("don't cares") or all of the fundamental products which must not be included in the function and all of the unspecifi... View full abstract»

• ### Use of a list processing language in programming simplification procedures

Publication Year: 1961, Page(s):18 - 26
Cited by:  Papers (1)
| | PDF (2899 KB)

There are several reasons which make the use of a list processing type of computer programming language attractive for the coding of logical algorithms such as those which arise in truth function simplification. Among the most important programming advantages are ease of coding, improved use of computer storage, and a reduction of limitations on the number of variables which can be handled. Also o... View full abstract»

• ### Threshold logic and two-person, zero-sum games

Publication Year: 1961, Page(s):27 - 33
Cited by:  Papers (9)
| | PDF (959 KB)

It is shown that the problem of determining whether or not a given switching function is realizable with a single threshold gate can be reduced directly to that of determining the value of a two-person, zero-sum game. If this value is $gt$ 1/2, the function is realizable. If the value is $geq$ 1/2, the function cannot be realized. In the case of realizability the solution of the game gives the set... View full abstract»

• ### On the characterization of threshold functions

Publication Year: 1961, Page(s):34 - 38
Cited by:  Papers (44)
| | PDF (599 KB)

This paper derives a set of parameters which characterize functions realizable with single threshold devices. A Boolean function of n variables is a function on the vertices of an n-dimensional cube to 0 and 1. Considering the vertices as n-dimensional vectors, the ordinary vector sum (or the center of gravity) of the true vertices and the number of true vertices determine the realizability. It is... View full abstract»

• ### Functional forms of majority functions and a necessary and sufficient condition for their realizability

Publication Year: 1961, Page(s):39 - 46
Cited by:  Papers (9)
| | PDF (1091 KB)

Functional forms of the majority functions and a wider class of functions, called "dual-comparable functions are discussed. Then, a necessary and sufficient condition for realizability of a majority function in a language of a functional form and miscellaneous properties of the majority functions are shown. View full abstract»

• ### The profile technique for the desing of threshold device logic

Publication Year: 1961, Page(s):47 - 54
Cited by:  Papers (5)
| | PDF (1237 KB)

A technique is presented for the design of single stage linear input threshold logic. Given the solution of a switching function as a set of windings on a magnetic core, the magnetomotive force is easily computed for each state of an n-variable binary truth table. The profile of the switching function is a graphical plot of the m.m.f. 's as a function of the states of the truth table. The truth fu... View full abstract»

• ### More about threshold logic

Publication Year: 1961, Page(s):55 - 64
Cited by:  Papers (12)
| | PDF (1367 KB)

We pursue in this paper some of the ideas discussed a year ago at the First Annual Symposium on Switching Theory and Logical Design. For a general discussion of threshold logic, and for definitions and motivations of the terms used below, the reader is referred to "Single Stage Threshold Logic" also published in this volume [13]. Also, a general survey of recent papers in the subject has been publ... View full abstract»

• ### The integrative properties of neurons

Publication Year: 1961, Page(s):67 - 69
| | PDF (453 KB)

We pursue in this paper some of the ideas discussed a year ago at the First Annual Symposium on Switching Theory and Logical Design. For a general discussion of threshold logic, and for definitions and motivations of the terms used below, the reader is referred to "Single Stage Threshold Logic" also published in this volume [13]. Also, a general survey of recent papers in the subject has been publ... View full abstract»

• ### Mathematical models of neurone interaction

Publication Year: 1961, Page(s):70 - 76
| | PDF (1237 KB)

Some properties of neurons are discussed which must be considered in formulating models of their interaction. Among these are characteristics of nerve membranes. Under certain weak conditions on the parameters a neural element may behave as a logical element. With other values of the parameters the behavior can be approximated by a continuous model in which only an average output rate is taken int... View full abstract»

• ### Multivalued logic devices for simulating threshold neurons

Publication Year: 1961, Page(s):77 - 82
| | PDF (841 KB)

A neuron model is given whose properties adhere as closely as possible to the known properties of living neurons. Essential use is made of the concept that information to the nerve is in the form of pulse-rate information. Since this kind of information can assume more than two values, the model becomes a multivalued-logic device with a threshold. The output value of the neuron model is equal to t... View full abstract»

• ### Many-valued logics and reliable homeostatic mechanisms

Publication Year: 1961, Page(s):83 - 84
| | PDF (261 KB)

A neuron model is given whose properties adhere as closely as possible to the known properties of living neurons. Essential use is made of the concept that information to the nerve is in the form of pulse-rate information. Since this kind of information can assume more than two values, the model becomes a multivalued-logic device with a threshold. The output value of the neuron model is equal to t... View full abstract»

• ### An introduction to speed independent circuit theory

Publication Year: 1961, Page(s):87 - 93
Cited by:  Papers (6)
| | PDF (1017 KB)

A neuron model is given whose properties adhere as closely as possible to the known properties of living neurons. Essential use is made of the concept that information to the nerve is in the form of pulse-rate information. Since this kind of information can assume more than two values, the model becomes a multivalued-logic device with a threshold. The output value of the neuron model is equal to t... View full abstract»

• ### One method for designing speed independent logic for a control

Publication Year: 1961, Page(s):94 - 105
Cited by:  Papers (7)
| | PDF (1468 KB)

Since the design of speed independent logic, like many other synthesis procedures, does not produce a unique topology, a design technique has been developed at Illinois to insure consistency throughout the control. The majority of the logical design problems were presented as information flow charts to be realized. All of the typical sections of flow charts were realized in a speed independent man... View full abstract»

• ### Problems in the physical realization of speed independent circuits

Publication Year: 1961, Page(s):106 - 108
Cited by:  Papers (4)
| | PDF (468 KB)

This paper presents examples illustrative of practical problems encountered in the physical realization of a speed independent control for a high speed computer under construction at the University of Illinois. Three separate problems are described; each is related to an assumption on which the theory of speed independent circuits is based. View full abstract»

• ### A flow chart notation for the description of a speed- independent control

Publication Year: 1961, Page(s):109 - 110
Cited by:  Papers (4)
| | PDF (409 KB)

This paper presents examples illustrative of practical problems encountered in the physical realization of a speed independent control for a high speed computer under construction at the University of Illinois. Three separate problems are described; each is related to an assumption on which the theory of speed independent circuits is based. View full abstract»

• ### Memorial session for S. H. Caldwell (1904-1960)

Publication Year: 1961, Page(s): 113
| PDF (27 KB)
• ### Transient behavior in iterative combinational switching networks

Publication Year: 1961, Page(s):114 - 128
Cited by:  Papers (1)
| | PDF (2174 KB)

This paper concerns switching networks which consist of n identical combinational logic cells interconnected from left to right by "alpha" communication channels into linear arrays. The synchronous cells in these networks have unit switching delays separating their receipts of external x and left-neighbor alpha inputs from their corresponding productions of external z and right-neighbor alpha outp... View full abstract»

• ### Operations on finite automata

Publication Year: 1961, Page(s):129 - 132
Cited by:  Papers (9)
| | PDF (585 KB)

This paper concerns switching networks which consist of n identical combinational logic cells interconnected from left to right by alpha communication channels into linear arrays. The synchronous cells in these networks have unit switching delays separating their receipts of external x and left-neighbor alpha inputs from their corresponding productions of external z and right-neighbor alpha output... View full abstract»

• ### Delayed-logic and finite-state machines

Publication Year: 1961, Page(s):133 - 151
Cited by:  Papers (26)
| | PDF (2156 KB)

This paper concerns switching networks which consist of n identical combinational logic cells interconnected from left to right by alpha communication channels into linear arrays. The synchronous cells in these networks have unit switching delays separating their receipts of external x and left-neighbor alpha inputs from their corresponding productions of external z and right-neighbor alpha output... View full abstract»

• ### Techniques for the diagnosis of switching circuit failures

Publication Year: 1961, Page(s):152 - 160
Cited by:  Papers (13)
| | PDF (1059 KB)

In 2.12 minutes an IBM 7090 program found four input tests (for an 8-input parity check circuit) whose outcome determines whether any one of 102 possible failures occurred. For any single-output combinational circuit, with no more than 35 input variables, the program computes the set of all inputs detecting a given failure - the essential novelty of the method. These sets, one for each failure, ar... View full abstract»