Default Cover Image

1st and 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1960-1961)

Oct. 17 1961 to Oct. 20 1961

Detroit, MI

Table of Contents

Table of contentsFreely available from IEEE.pp. vii-ix
ForewordFreely available from IEEE.pp. iii-iii
PrefaceFreely available from IEEE.pp. v-vi
An application of linear programming to the minimization of Boolean functionsFull-text access may be available. Sign in or learn about subscription options.pp. 3-9
Minimal sums for Boolean functions having many unspecified fundamental productsFull-text access may be available. Sign in or learn about subscription options.pp. 10-17
Use of a list processing language in programming simplification proceduresFull-text access may be available. Sign in or learn about subscription options.pp. 18-26
Threshold logic and two-person, zero-sum gamesFull-text access may be available. Sign in or learn about subscription options.pp. 27-33
On the characterization of threshold functionsFull-text access may be available. Sign in or learn about subscription options.pp. 34-38
Functional forms of majority functions and a necessary and sufficient condition for their realizabilityFull-text access may be available. Sign in or learn about subscription options.pp. 39-46
The profile technique for the desing of threshold device logicFull-text access may be available. Sign in or learn about subscription options.pp. 47-54
More about threshold logicFull-text access may be available. Sign in or learn about subscription options.pp. 55-64
The integrative properties of neuronsFull-text access may be available. Sign in or learn about subscription options.pp. 67-69
Mathematical models of neurone interactionFull-text access may be available. Sign in or learn about subscription options.pp. 70-76
Multivalued logic devices for simulating threshold neuronsFull-text access may be available. Sign in or learn about subscription options.pp. 77-82
Many-valued logics and reliable homeostatic mechanismsFull-text access may be available. Sign in or learn about subscription options.pp. 83-84
An introduction to speed independent circuit theoryFull-text access may be available. Sign in or learn about subscription options.pp. 87-93
One method for designing speed independent logic for a controlFull-text access may be available. Sign in or learn about subscription options.pp. 94-105
Problems in the physical realization of speed independent circuitsFull-text access may be available. Sign in or learn about subscription options.pp. 106-108
A flow chart notation for the description of a speed- independent controlFull-text access may be available. Sign in or learn about subscription options.pp. 109-110
Transient behavior in iterative combinational switching networksFull-text access may be available. Sign in or learn about subscription options.pp. 114-128
Operations on finite automataFull-text access may be available. Sign in or learn about subscription options.pp. 129-132
Delayed-logic and finite-state machinesFull-text access may be available. Sign in or learn about subscription options.pp. 133-151
Techniques for the diagnosis of switching circuit failuresFull-text access may be available. Sign in or learn about subscription options.pp. 152-160
Some unsolved problems in switching theoryFull-text access may be available. Sign in or learn about subscription options.pp. 163-165
Two problems on threshold functionsFull-text access may be available. Sign in or learn about subscription options.pp. 166-166
Canonical forms of functions in p-valued logicsFull-text access may be available. Sign in or learn about subscription options.pp. 169-177
Boolean two-terminal analysis and synthesisFull-text access may be available. Sign in or learn about subscription options.pp. 178-181
A computer program for the synthesis of combinational switching circuitsFull-text access may be available. Sign in or learn about subscription options.pp. 182-194
Automatic fault detection in combinational switching networksFull-text access may be available. Sign in or learn about subscription options.pp. 195-214
Switching function canonical forms based on commutative and associative binary operationsFull-text access may be available. Sign in or learn about subscription options.pp. 217-224
Truth functions realizable by single threshold organsFull-text access may be available. Sign in or learn about subscription options.pp. 225-245
A method for factoring the action of asynchronous circuitsFull-text access may be available. Sign in or learn about subscription options.pp. 246-249
A four-megacycle, 24-bit checked binary adderFull-text access may be available. Sign in or learn about subscription options.pp. 250-265
Boolean matrices applied to sequential circuit theory and threshold logicsFull-text access may be available. Sign in or learn about subscription options.pp. 266-272
Forcing circuitry -- Sequential building blocks for logical designFull-text access may be available. Sign in or learn about subscription options.pp. 273-291
Current-operated diode logic gatesFull-text access may be available. Sign in or learn about subscription options.pp. 292-308
The decision and synthesis problems in semimodular switching theoryFull-text access may be available. Sign in or learn about subscription options.pp. 309-320
Single stage threshold logicFull-text access may be available. Sign in or learn about subscription options.pp. 321-332
Author indexFreely available from IEEE.pp. 341-341
Showing 40 out of 40