Advanced Theory of the Logical Design of Digital Computers: An Intensive Course for Practicing Scientists and Engineers |
From inside the book
Results 1-3 of 61
Page 1347
... method of displaying a Boolean function is to map it in a coordinate system in which the axes are the vari- ables or ... method was developed at the Computation Laboratory of Harvard University . ( I ) Another method , Another method ...
... method of displaying a Boolean function is to map it in a coordinate system in which the axes are the vari- ables or ... method was developed at the Computation Laboratory of Harvard University . ( I ) Another method , Another method ...
Page 1443
... method has been presented for writing any transnas- This method is similar to that of Qrune , how-、 sig itteant m.provements have been made The notation mpted by using the synibois 0 , 1 and instead of prosed " in itself , this 1 ...
... method has been presented for writing any transnas- This method is similar to that of Qrune , how-、 sig itteant m.provements have been made The notation mpted by using the synibois 0 , 1 and instead of prosed " in itself , this 1 ...
Page
... method ( a ) ( among others ) with all a and b = 2 but with the infinite matrices regarded a1 by as infinite sequences of k ( n ) -tuples . E. F. Moore [ 4 ] uses method ( b ) with k = 1 and n = 1 but with a1 and by arbitrary . S. C. ...
... method ( a ) ( among others ) with all a and b = 2 but with the infinite matrices regarded a1 by as infinite sequences of k ( n ) -tuples . E. F. Moore [ 4 ] uses method ( b ) with k = 1 and n = 1 but with a1 and by arbitrary . S. C. ...
Contents
The logic of classes 1 | 1247 |
The logic of propositions 5 | 1255 |
Boolean algebra in switching networks | 1263 |
6 other sections not shown
Common terms and phrases
algebra assignment asynchronous circuits basis rows behavior BELL SYSTEM Boolean algebra BOOLEAN FUNCTIONS branch carry leads carry-variables cell assemblies characters circuitry clause column combinational circuit connection matrix contact network contains corresponding cycle d-terms defined denote determined diagram disjunction electronic entries example expression finite flow table given graph input sequence input-carry inverse iterative network k-tuples letters logical method minimum sum negation neuron node normal formula obtained operation output table output-carry pairs partitioning possible prime implicant table problem procedure pulse R-sequences realized regular expression result selected rows sequential circuits Sheffer stroke shown in Figure signals simplest normal equivalent SIMPLIFYING TRUTH FUNCTIONS STANFORD subsumes switch tube switching circuits switching element switching function symbol synapses synthesis table of combinations tape terminal Theorem theory tion toggle transition transmission TRUTH FUNCTIONS truth table UNIVERSITY vertex voltage W. V. QUINE Y₁ Y₂ zero