Logical Machine Design II: A Selected Bibliography

This paper presents a selection of current bibliographic references in the field of the logical design of machines. Selections were made with the objective of being useful and stimulatory to the wide variety of scientific persons who have some interest in this subject. An essential feature of the report is the extensive index of significant title words. Each indexed word is given in the complete context of the title in which it occurs.

[1]  James P. Lipp.  Topology of Switching Elements vs. Reliability , 1957 .

[2]  Robert McNaughton,et al.  The folded tree , 1955 .

[3]  David S. Slepian,et al.  A note off two binary signaling alphabets , 1956, IRE Trans. Inf. Theory.

[4]  Cravens L. Wanlass.  Transistor Circuitry for Digital Computers , 1955, IRE Trans. Electron. Comput..

[5]  Noah S. Prywes.  Diodeless Magnetic Shift Registers Utilizing Transfluxors , 1958, IRE Trans. Electron. Comput..

[6]  N. S. Mendelsohn,et al.  Some generalizations of the problem of distinct representatives , 1958 .

[7]  J. C. Logue,et al.  An experimental transistorized calculator , 1955, Electrical Engineering.

[8]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[9]  B. J. Yokelson,et al.  Semiconductor circuit design philosophy for the central control of an electronic switching system , 1958 .

[10]  Warren S. Mcculloch,et al.  The brain computing machine , 1949, Electrical Engineering.

[11]  Jan Kalicki.  A Test for the Existence of Tautologies According to Many-Valued Truth-Tables , 1950, J. Symb. Log..

[12]  Raymond J. Nelson,et al.  Weak simplest normal truth functions , 1955, Journal of Symbolic Logic.

[13]  Louis N. Ridenour,et al.  The Role of the Computer , 1952 .

[14]  N. Rashevsky.  Contributions to topological biology: Some considerations on the primordial graph and on some possible transformations , 1956 .

[15]  E. N. Gilbert.  N-terminal switching circuits , 1951 .

[16]  S. H. Caldwell.  The recognition and identification of symmetric switching functions , 1954, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[17]  H. B. Curry.  II.—MATHEMATICS, SYNTACTICS AND LOGIC1 , 1953 .

[18]  Tung Chang,et al.  DiodeCoincidence andMixing Circuits in Digital Computers , 1950 .

[19]  Alonzo Church,et al.  Review: Theodore A. Kalin, Formal Logic and Switching Circuits , 1953 .

[20]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.

[21]  J. Forrester.  Digital Information Storage in Three Dimensions Using Magnetic Cores , 1951 .

[22]  A. Bobeck,et al.  A new storage element suitable for large-sized memory arrays — The twistor , 1957 .

[23]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[24]  Daniel D. McCracken,et al.  The Monte Carlo Method , 1955 .

[25]  C. Y. Lee.  Switching functions on an n-dimensional cube , 1954, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[26]  J. A. Faris,et al.  The Gergonne Relations , 1955, J. Symb. Log..

[27]  S. C. Kleene.  Turing A. M.. Solvable and unsolvable problems. Science news (Penguin books, Melbourne–London–Baltimore), no. 31 (1954), pp. 7–23. , 1955 .

[28]  E. R. Stabler.  Boolean Representation Theory , 1944 .

[29]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[30]  Matrix analysis of oriented graphs with irreducible feedback loops , 1955, IRE Transactions on Circuit Theory.

[31]  Raymond J. Nelson.  Burkhart W. H.. Theorem minimization. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 259–263. , 1953 .

[32]  Alan Rose,et al.  Many-valued logical machines , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[33]  Owen R. Mock.  Logical Organization of the PACT I Compiler , 1956, JACM.

[34]  J. L. Smith,et al.  Organizing a network of computers to meet deadlines , 1957, IRE-ACM-AIEE '57 (Eastern).

[35]  Samuel J. Mason.  Topological Analysis of Linear Nonreciprocal Networks , 1957, Proceedings of the IRE.

[36]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[37]  W. H. Burkhart,et al.  Theorem minimization , 1952, ACM '52.

[38]  John R. Myhill.  On the interpretation of the sign , 1953 .

[39]  Hao Wang,et al.  Logic of many-sorted theories , 1952, Journal of Symbolic Logic.

[40]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[41]  Franz E. Hohn,et al.  Boolean matrices and the design of combinational relay switching circuits , 1955 .

[42]  Jan Kalicki,et al.  Note on Truth-Tables , 1950, J. Symb. Log..

[43]  S. H. Washburn.  An application of Boolean algebra to the design of electronic switching circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[44]  Allen Newell,et al.  Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[45]  A. W. Lo,et al.  The transfluxor , 1956, AIEE-IRE '56 (Western).

[46]  W. Huggins,et al.  Signal Theory , 1956 .

[47]  Franz Hohn,et al.  Some Mathematical Aspects of Switching , 1955 .

[48]  W. S. Bennett.  Minimizing and mapping sequential circuits , 1955, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[49]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[50]  I.A.D. Lewis.  A symbolic method for the solution of some switching and relay-circuit problems , 1951 .

[51]  Edward J. McCluskey,et al.  Detection of group invariance or total symmetry of a Boolean function , 1956 .

[52]  E C BERKELEY,et al.  The relations between symbolic logic and large-scale calculating machines. , 1950, Science.

[53]  F. J. Murray,et al.  Mechanisms and Robots , 1955, JACM.

[54]  S. Huzino.  ON SOME SEQUENTIAL MACHINES AND EXPERIMENTS , 1958 .

[55]  J. Ham.  A System-Theory Perspective for Signal Theory , 1956 .

[56]  Gene H. Leichner.  A Fast Circulating Memory , 1957, IRE Trans. Electron. Comput..

[57]  B. MELTZER,et al.  Digital Field Computers , 1958, Nature.

[58]  C. T. Leondes,et al.  The Design of Logical OR-AND-OR Pyramids for Digital Computers , 1953, Proceedings of the IRE.

[59]  D. Middleton,et al.  The Multipurpose Bias Device - Part II: The Efficiency of Logical Elements , 1959, IBM J. Res. Dev..

[60]  Zdzislaw Pawlak,et al.  Review: A. G. Lunc, Algebraic Methods of Analysis and Synthesis of Contact Networks , 1957 .

[61]  Richard F. Rutz.  Two-Collector Transistor for Binary Full Addition , 1957, IBM J. Res. Dev..

[62]  George A. Miller,et al.  Human memory and the storage of information , 1956, IRE Trans. Inf. Theory.

[63]  H. Quastler,et al.  The Complexity of Biological Computers , 1957, IRE Trans. Electron. Comput..

[64]  C. Coates,et al.  General Topological Formulas for Linear Network Functions , 1958 .

[65]  E. F. Moore.  A simplified universal Turing machine , 1952, ACM '52.

[66]  D. Katz.  A magnetic amplifier switching matrix , 1956, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[67]  R. A. Kudlich.  A set of transistor circuits for asynchronous, direct-coupled computers , 1955, AFIPS '55 (Western).

[68]  Warren L. Semon.  Synthesis of series-parallel network switching functions , 1958 .

[69]  Harry F. Olson,et al.  Phonetic typewriter , 1957 .

[70]  Robert Serrell,et al.  Elements of Boolean Algebra for the Study of Information-Handling Systems , 1953, Proceedings of the IRE.

[71]  W. E. Andrus.  The use of computing machines in the statistical evaluation of electrical components , 1956, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[72]  Robert L. Davis.  The number of structures of finite relations , 1953 .

[73]  Joyce Friedman,et al.  Some results in church's restricted recursive arithmetic , 1957, Journal of Symbolic Logic.

[74]  George A. Miller,et al.  Finite State Languages , 1958, Inf. Control..

[75]  Claude E. Shannon,et al.  Computers and Automata , 1953, Proceedings of the IRE.

[76]  M. Wells,et al.  Experiments in Chess , 1957, JACM.

[77]  Noam Chomsky,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[78]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[79]  L. C. Robbins.  An analysis by arithmetical methods of a calculating network with feedback , 1952, ACM '52.

[80]  M. Nesenbergs,et al.  Logic synthesis of some high-speed digital comparators , 1959 .

[81]  Allen Newell,et al.  The logic theory machine-A complex information processing system , 1956, IRE Trans. Inf. Theory.

[82]  Charles F. Pulvari,et al.  Memory Matrix Using Ferroelectric Condensers as Bistable Elements , 1955, JACM.

[83]  E. Albers-Schoenberg.  Ferrites for Microwave Circuits and Digital Computers , 1954 .

[84]  Robert H. Rediker,et al.  The Phase-Bistable Transistor Circuit , 1953, Proceedings of the IRE.

[85]  Arthur L. Samuel,et al.  Computing Bit by Bit or Digital Computers Made Easy , 1953, Proceedings of the IRE.

[86]  R. J. Kavanagh.  The application of matrix methods to multi-variable control systems , 1956 .

[87]  H. Trent.  A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH. , 1954, Proceedings of the National Academy of Sciences of the United States of America.

[88]  U. F. Gianola.  Nondestructive Memory Employing a Domain Oriented Steel Wire , 1958 .

[89]  Jr. Sheldon B. Akers,et al.  On a Theory of Boolean Functions , 1959 .

[90]  Raymond J. Nelson.  G. A. Montgomerie. Sketch for an algebra of relay and contactor circuits. Journal of the Institute of Electrical Engineers , vol. 95 (1948), pp. 303–312. , 1955 .

[91]  W. Ross Ashby,et al.  Design for an Intelligence-Amplifier , 1956 .

[92]  J. H. Robertson.  A Simple Machine Capable of Fourier Synthesis Calculation , 1950 .

[93]  Seymour Ginsburg,et al.  On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine , 1958, JACM.

[94]  Calvin C. Elgot,et al.  Mealy George H.. A method for synthesizing sequential circuits. The Bell System technical journal, vol. 34 (1955), pp. 1045–1079. , 1957, Journal of Symbolic Logic (JSL).

[95]  George Epstein.  Synthesis of Electronic Circuits for Symmetric Functions , 1958, IRE Trans. Electron. Comput..

[96]  James T. Culbertson,et al.  Some Uneconomical Robots , 1956 .

[97]  Steven Orey.  Stanley Robert L.. Simplified foundations for mathematical logic. The journal of symbolic logic, vol. 20 (1955), pp. 123–139. , 1956 .

[98]  R. Z. Norman,et al.  COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[99]  Theodore A. Kalin,et al.  Formal logic and switching circuits , 1952, ACM '52.

[100]  R. L. Dietzold.  Network theory comes of age , 1948, Electrical Engineering.

[101]  Raymond J. Nelson,et al.  Review: H. S. Caldwell, The Recognition and Identification of Symmetric Switching Functions; C. Y. Lee, Switching Functions on an n-Dimensional Cube , 1955 .

[102]  G. R. Stibitz.  A Note on "Is" and "Might Be" in Computers , 1950 .

[103]  R. Lyndon.  Identities in two-valued calculi , 1951 .

[104]  Stuart Chase.  THE LOGICAL ANIMAL , 1956 .

[105]  William D. Rowe,et al.  Transistor NOR circuit design , 1957, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[106]  R. M. Brown.  Some Notes on Logical Binary Counters , 1955, IRE Trans. Electron. Comput..

[107]  F. Reza.  Some Topological Considerations in Network Theory , 1958 .

[108]  Harold Wolpe.  Algorithm for analyzing logical statements to produce a truth function table , 1958, CACM.

[109]  H. D. Huskey,et al.  The SWAC-Design Features and Operating Experience , 1953 .

[110]  Gene W. Arant.  A Time-Sequential Tabular Analysis of Flip-Flop Logical Operation , 1957, IRE Trans. Electron. Comput..

[111]  John H. Holland,et al.  Tests on a cell assembly theory of the action of the brain, using a large digital computer , 1956, IRE Trans. Inf. Theory.

[112]  Pawel Szeptycki.  Review: Frantisek Svoboda, A Semiautomatic Experimental Machine for the Analysis and Synthesis of Relay Circuits; F. Svoboda, Automatic Synthesis of Relay Circuits , 1958 .

[113]  R. J. Nelson.  Review: Arthur W. Burks, Robert McNaughton, Carl H. Pollmar, Don W. Warren, Jesse B. Wright, Complete Decoding Nets: General Theory and Minimality , 1956 .

[114]  Bernard Harris.  An Algorithm for Determining Minimal Representations of a Logic Function , 1957, IRE Trans. Electron. Comput..

[115]  Joseph O. Campeau.  The Synthesis and Analysis of Digital Systems by Boolean Matrices , 1957, IRE Trans. Electron. Comput..

[116]  C. Y. Lee.  Analysis of switching networks , 1955 .

[117]  Morton William Marcovitz,et al.  Analytical Design of Resistor-Coupled Transistor Logical Circuits , 1958, IRE Trans. Electron. Comput..

[118]  E. F. Morris,et al.  Automatic implementation of computer logic , 1958, CACM.

[119]  Edward J. McCluskey.  Iterative Combinational Switching Networksߞ General Design Considerations , 1958, IRE Trans. Electron. Comput..

[120]  Chaang Huang,et al.  Field effect transistor applications , 1955, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[121]  S. H. Unger,et al.  A Computer Oriented toward Spatial Problems , 1958 .

[122]  Claude E. Shannon,et al.  Reliable Circuits Using Less Reliable Relays , 1956 .

[123]  Donald M. MacKay,et al.  Quantal aspects of scientific information , 1953, Trans. IRE Prof. Group Inf. Theory.

[124]  Lars Löfgren,et al.  Automata of High Complexity and Methods of Increasing Their Reliability by Redundancy , 1958, Inf. Control..

[125]  W. S. Percival.  The graphs of active networks , 1955 .

[126]  K. Bochenek,et al.  Application of bi-elemental boolean algebra to electronic circuits , 1955 .

[127]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[128]  W. V. Quine,et al.  Unification of universes in set theory , 1956, Journal of Symbolic Logic.

[129]  Hewitt D. Crane,et al.  Current Steering in Magnetic Circuits , 1957, IRE Trans. Electron. Comput..

[130]  Claude E. Shannon,et al.  The Number of Two‐Terminal Series‐Parallel Networks , 1942 .

[131]  Marc Shiowitz.  High-Speed Digital Computers , 1954, Transactions of the IRE Professional Group on Radio Telemetry and Remote Control.

[132]  M. P. Schützenberger.  A tentative classification of goal-seeking behaviours. , 1954 .

[133]  F. Harary.  THE NUMBER OF LINEAR, DIRECTED, ROOTED, AND CONNECTED GRAPHS , 1955 .

[134]  Jack L. Rosenfeld.  Magnetic Core Pulse-Switching Circuits for Standard Packages , 1958, IRE Trans. Electron. Comput..

[135]  Nathaniel Rochester,et al.  Intelligent Behavior in Problem-Solving Machines , 1958, IBM J. Res. Dev..

[136]  Noah S. Prywes,et al.  High-Speed Shift Registers Using One Core Per Bit , 1956, IRE Trans. Electron. Comput..

[137]  R. A. Henle.  A multistable transistor circuit , 1955, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[138]  Martin H. Weik.  A SECOND SURVEY OF DOMESTIC ELECTRONIC DIGITAL COMPUTING SYSTEMS.. , 1957 .

[139]  A. M. Uttley,et al.  Temporal and Spatial Patterns in a Conditional Probability Machine , 1956 .

[140]  David H. Schaefer.  A rectifier algebra , 1955, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[141]  Midhat J. Ghazala.  Irredundant Disjunctive and Conjunctive Forms of a Boolean Function , 1957, IBM J. Res. Dev..

[142]  W. J. Pietenpol,et al.  Some Circuit Properties and Applications of n-p-n Transistors , 1951, Proceedings of the IRE.

[143]  A. H. Scheinman.  A numerical-graphical method for synthesizing switching circuits , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[144]  Max Black.  Review: Alonzo Church, Introduction to Mathematical Logic , 1957 .

[145]  W. F. Bauer.  Computer design from the programmer's viewpoint , 1958, AIEE-ACM-IRE '58 (Eastern).

[146]  Mandalay Grems,et al.  A truly automatic computing system , 1956, AIEE-IRE '56 (Western).

[147]  Arthur Pap.  Strict Implication, Entailment, and Modal Iteration , 1955 .

[148]  L. J. Andrews.  A technique for using memory cores as logical elements , 1956, AIEE-IRE '56 (Eastern).

[149]  G.M. Hopper,et al.  Influence of programming techniques on the design of computers , 1984, Proceedings of the IEEE.

[150]  E. J. Schubert.  Matrix analysis of logical networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[151]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[152]  Raymond E. Miller,et al.  Formal Analysis and Synthesis of Bilateral Switching Networks , 1958, IRE Trans. Electron. Comput..

[153]  Raymond J. Nelson.  Review: D. E. Muller, Application of Boolean Algebra to Switching Circuit Design and to Error Detection , 1955 .

[154]  Gerald B. Standley.  Ideographic Computation in the Propositional Calculus , 1954, J. Symb. Log..

[155]  H. William Collins.  Magnetic amplifier control of switching transistors , 1956, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[156]  M. Stone.  The theory of representations for Boolean algebras , 1936 .

[157]  R. Sittler,et al.  Systems Analysis of Discrete Markov Processes , 1956 .

[158]  Stanley P. Frankel,et al.  On the Minimum Logical Complexity Required for a General Purpose Computer , 1958, IRE Trans. Electron. Comput..

[159]  J. Suran,et al.  Multihole Ferrite Core Configurations and Applications , 1957, Proceedings of the IRE.

[160]  E. Gilbert.  Gray codes and paths on the N-cube , 1958 .

[161]  E. Gilbert.  Lattice Theoretic Properties of Frontal Switching Functions , 1954 .

[162]  G. Constantine.  A Load-Sharing Matrix Switch , 1958, IBM J. Res. Dev..

[163]  J. Anderson,et al.  Ferroelectric storage elements for digital computers and switching systems , 1952, Electrical Engineering.

[164]  W. Pitts,et al.  How we know universals; the perception of auditory and visual forms. , 1947, The Bulletin of mathematical biophysics.

[165]  John V. Blankenbaker.  Logically Micro-Programmed Computers , 1958, IRE Trans. Electron. Comput..

[166]  Claude E. Shannon,et al.  Machine Aid for Switching Circuit Design , 1953, Proceedings of the IRE.

[167]  Roderick Gould.  A Note on Contact Networks for Switching Functions of Four Variables , 1958, IRE Trans. Electron. Comput..

[168]  Calvin C. Elgot,et al.  Realization of Events by Logical Nets , 1958, JACM.

[169]  D. Buck,et al.  The Cryotron-A Superconductive Computer Component , 1956, Proceedings of the IRE.

[170]  The number of oriented graphs. , 1957 .

[171]  Tung Chang Chen.  Diode Coincidence and Mixing Circuits in Digital Computers , 1950, Proceedings of the IRE.

[173]  S. Mason.  About Such Things as Unistors, Flow Graphs, Probability, Partial Factoring, and Matrices , 1957 .

[174]  R. D. Berlin.  Synthesis of N-Valued Switching Circuits , 1958, IRE Trans. Electron. Comput..

[175]  R. A. Wallace,et al.  The maze solving computer , 1952, ACM '52.

[176]  P R Halmos.  PREDICATES, TERMS, OPERATIONS, AND EQUALITY IN POLYADIC BOOLEAN ALGEBRAS. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[177]  L. P. Hunter,et al.  High Speed Coincident‐Flux Magnetic Storage Principles , 1956 .

[178]  Fritz Zwicky,et al.  On a new type of reasoning and some of its possible consequences , 1933 .

[179]  T. H. Crowley,et al.  The Laddic — A magnetic device for performing logic , 1959 .

[180]  Robert W. Murphy.  A Positive-Integer Arithmetic for Data Processing , 1957, IBM J. Res. Dev..

[181]  Robert C. Minnick,et al.  Multiple Coincidence Magnetic Storage Systems , 1955 .

[182]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[183]  Marcel J. E. Golay,et al.  Binary coding , 1954, Transactions of the IRE Professional Group on Information Theory.

[184]  W. Shockley,et al.  A Unipolar "Field-Effect" Transistor , 1952, Proceedings of the IRE.

[185]  I. L. Auerbach,et al.  Magnetic elements in arithmetic and control circuits , 1955, Electrical Engineering.

[186]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.

[187]  H. J. Gray,et al.  Numerical methods in digital real-time simulation , 1954 .

[188]  Roderick Gould.  Graphs and Vector Spaces , 1958 .

[189]  Garrett Birkhoff,et al.  Distributive postulates for systems like Boolean algebras , 1946 .

[190]  D. R. Fulkerson,et al.  Network Flow and Systems of Representatives , 1958, Canadian Journal of Mathematics.

[191]  Horace M. Trent,et al.  Isomorphisms between Oriented Linear Graphs and Lumped Physical Systems , 1955 .

[192]  Don W. Warren,et al.  Complete Decoding Nets: General Theory and Minimality , 1954 .

[193]  Richard M. Friedberg,et al.  A Learning Machine: Part I , 1958, IBM J. Res. Dev..

[194]  I. M. Ross,et al.  The field effect transistor , 1955 .

[195]  Andrew Henry Bobeck.  New Concept in Large‐Size Memory Arrays—the Twistor , 1958 .

[196]  J. A. Postley.  A method for the evaluation of a system of Boolean algebraic equations , 1955 .

[197]  Willis H. Ware.  The Logical Principles of a New Kind of Binary Counter , 1953, Proceedings of the IRE.

[198]  Don W. Warren,et al.  An analysis of a logical machine using parenthesis-free notation , 1954 .

[199]  N. Rochester,et al.  The logical organization of the new IBM scientific calculator , 1952, ACM '52.

[200]  J. Torkel Wallmark,et al.  Integrated Devices Using Direct-Coupled Unipolar Transistor Logic , 1959, IRE Trans. Electron. Comput..

[201]  Lillian R. Lieber,et al.  The great discovery of modern mathematics , 1957, IRE Transactions on Military Electronics.

[202]  M. Stone,et al.  Postulates for Boolean Algebras and Generalized Boolean Algebras , 1935 .

[203]  Maurice V. Wilkes,et al.  The design of the control unit of an electronic digital computer , 1958 .

[204]  W. H. MacWilliams.  Computers — Past, present, and future , 1953, Electrical Engineering.

[205]  E. E. Loebner.  Opto-Electronic Devices and Networks , 1955, Proceedings of the IRE.

[206]  R. A. Henle,et al.  The Application of Transistors to Computers , 1958, Proceedings of the IRE.

[207]  R. Luce.  A note on Boolean matrix theory , 1952 .

[208]  M. E. Maron.  Logic, discovery, and the foundations of computing machinery , 1954, Trans. I R E Prof. Group Electron. Comput..

[209]  On the Number of Dissimilar Graphs Between a Given Graph-Subgraph Pair , 1958, Canadian Journal of Mathematics.

[210]  Gene H. Leichner.  Designing Computer Circuits with a Computer , 1957, JACM.

[211]  H. S. Shapiro,et al.  On the Mathematical Theory of Error-Correcting Codes , 1959, IBM J. Res. Dev..

[212]  Robert S. Ledley,et al.  Mathematical Foundations and Computational Methods for a Digital Logic Machine , 1954, Oper. Res..

[213]  I. M. Ross,et al.  Unipolar "Field-Effect" Transistor , 1953, Proceedings of the IRE.

[214]  Hilary Putnam,et al.  Decidability and essential undecidability , 1957, Journal of Symbolic Logic.

[215]  E J GREEN,et al.  Rate as response probability in discrimination learning. , 1957, Science.

[216]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[217]  W. Percival.  The solution of passive electrical networks by means of mathematical trees , 1953 .

[218]  Berkeley Edmund C.. The algebra of states and events. The scientific monthly, vol. 78 (1954), pp. 232–242. , 1955 .

[219]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[221]  Hao Wang,et al.  A Variant to Turing's Theory of Computing Machines , 1957, JACM.

[222]  J. F. Jacobs,et al.  The lexical design of a digital computer for a large-scale real-time application , 1957, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[223]  G. H. Buffery.  A contribution to the algebra of relay and switch contacts , 1951 .

[224]  T. J. Beatson.  Minimization of components in electronic switching circuits , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[225]  M. Kochen,et al.  Automatic network analysis with a digital computation system , 1956, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[226]  Claude E. Shannon,et al.  General treatment of the problem of coding , 1953, Trans. IRE Prof. Group Inf. Theory.

[227]  C. Shannon.  Von Neumann's contributions to automata theory , 1958 .

[228]  Claude E. Shannon,et al.  A Universal Turing Machine with Two Internal States , 1956 .

[229]  I. Cederbaum.  Matrices All of Whose Elements and Subdeterminants are 1, −1, or 0 , 1957 .

[230]  J. Harris.  A Transistor Shift Register and Serial Adder , 1952, Proceedings of the IRE.

[231]  Hewitt D. Crane,et al.  A High-Speed Logic System Using Magnetic Elements and Connecting Wire Only , 1959, Proceedings of the IRE.

[232]  Jan Kalicki.  An Undecidable Problem in the Algebra of Truth-Tables , 1954, J. Symb. Log..

[233]  J. Riordan.  The numbers of labeled colored and chromatic trees , 1957 .

[234]  G.B.B. Chaplin.  The transistor regenerative amplifier as a computer element , 1954 .

[235]  H. Statz,et al.  The Spacistor, A New Class of High-Frequency Semiconductor Devices , 1957, Proceedings of the IRE.

[236]  S. Guterman,et al.  Logical and Control Functions Performed with Magnetic Cores , 1955, Proceedings of the IRE.

[237]  A. M. Uttley,et al.  Information, machines, and brains , 1953, Trans. IRE Prof. Group Inf. Theory.

[238]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[239]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[240]  Stanley P. Frankel,et al.  The Logical Design of a Simple General Purpose Computer , 1957, IRE Trans. Electron. Comput..

[241]  L. Ridenour.  An Elementary Survey of Present Developments and Future Trends , 1950 .

[242]  A. W. Holt,et al.  An experimental rapid access memory using diodes and capacitors , 1952, ACM '52.

[243]  Orrin Frink,et al.  Representations of Boolean algebras , 1941 .

[244]  T. P. Bothwell,et al.  Logic Circuits for a Transistor Digital Computer , 1956, IRE Trans. Electron. Comput..

[245]  Jan A. Rajchman,et al.  A Myriabit Magnetic-Core Matrix Memory , 1953, Proceedings of the IRE.

[246]  S. R. Cray,et al.  A progress report on computer applications in computer design , 1956, AIEE-IRE '56 (Western).

[247]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[248]  Mitchell P. Marcus.  Minimization of the Partially-Developed Transfer Tree , 1957, IRE Trans. Electron. Comput..

[249]  Robert L. Stanley.  Simplified Foundations for Mathematical Logic , 1955, J. Symb. Log..

[250]  L. Zadeh.  What is optimal? (Edtl.) , 1958 .

[251]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .

[252]  A. Eugene Anderson,et al.  Transistors in Switching Circuits , 1952, Proceedings of the IRE.

[253]  Alston S. Householder,et al.  Generation of errors in digital computation , 1954 .

[254]  L. Weinberg,et al.  Correction to 'Kirchoff's Third and Fourth Laws' , 1958 .

[255]  William Tuthill Parry.  A New Symbolism for the Propositional Calculus , 1954, J. Symb. Log..

[256]  F. Harary,et al.  The Number of Complete Cycles in a Communication Network , 1954 .

[257]  Alonzo Church,et al.  Hartree Douglas R.. Calculating instruments and machines. The University of Illinois Press, Urbana 1949, ix + 138 pp. , 1953, Journal of Symbolic Logic.

[258]  Jacob Shekel.  Sketch for an Algebra of Switchable Networks , 1953, Proceedings of the IRE.

[259]  L. Penrose,et al.  MECHANICS OF SELF‐REPRODUCTION , 1958, Annals of human genetics.

[260]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[261]  Arthur W. Burks,et al.  The logical design of an idealized general-purpose computer , 1956 .

[262]  Mitchell P. Marcus,et al.  The Detection and Identification of Symmetric Switching Functions with the Use of Tables of Combinations , 1956, IRE Trans. Electron. Comput..

[263]  Albert A. Mullin.  Reliable stochastic sequential switching circuits , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[264]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[265]  Sundaram Seshu,et al.  The Theory of Nets , 1957, IRE Trans. Electron. Comput..

[266]  George N. Raney,et al.  Sequential Functions , 1958, JACM.

[267]  Robert McNaughton,et al.  Nelson Raymond J.. Simplest normal truth functions. The journal of symbolic logic, vol. 20 (1955), pp. 105–108.Quine W. V.. A way to simplify truth functions. The American mathematical monthly, vol. 62 (1955), pp. 627–631. , 1956, Journal of Symbolic Logic (JSL).

[268]  Matthew Raspanti.  A complex algebra for relay circuits , 1953, Electrical Engineering.

[269]  R. Luce.  Networks Satisfying Minimality Conditions , 1953 .

[270]  Haskell B Curry.  On the definition of substitution, replacement and allied notions in a abstract formal system , 1952 .

[271]  S. W. Dunwell,et al.  Design objectives for the IBM stretch computer , 1956, AIEE-IRE '56 (Eastern).

[272]  M. Aaron,et al.  The Use of Least Squares in System Design , 1956 .

[273]  Robert E. Wall.  Some of the engineering aspects of the machine translation of language , 1956, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[274]  J. M. Simon,et al.  Some aspects of the network analysis of sequence transducers , 1958 .

[275]  Hartley Rogers,et al.  Certain Logical Reduction and Decision Problems , 1956 .

[276]  Jerome Rothstein.  Information, organization and systems , 1954, Trans. IRE Prof. Group Inf. Theory.

[277]  G. A. Montgomerie,et al.  Sketch for an algebra of relay and contactor circuits , 1948 .

[278]  Robert M. Walker,et al.  Reliability Improvement by the Use of Multiple-Element Switching Circuits , 1958, IBM J. Res. Dev..

[279]  Transistor Amplifiers for Use in a Digital Computer , 1956, Proceedings of the IRE.

[280]  M. Karnaugh,et al.  Pulse-Switching Circuits Using Magnetic Cores , 1955, Proceedings of the IRE.

[281]  Frank Harary,et al.  Some Properties of n-Adic Relations , 1956 .

[282]  Harold D. Ross.  The Arithmetic Element of the IBM Type 701 Computer , 1953, Proceedings of the IRE.

[283]  V. Belevitch,et al.  Recent Russian Publications on Switching Theory , 1956, IRE Transactions on Circuit Theory.

[284]  Bradford Dunham,et al.  The Multipurpose Bias Device - Part I: The Commutator Transistor , 1957, IBM J. Res. Dev..

[285]  Kurt Bing,et al.  On simplifying truth-functional formulas , 1956, Journal of Symbolic Logic.

[286]  Claude E. Shannon,et al.  The lattice theory of information , 1953, Trans. IRE Prof. Group Inf. Theory.

[287]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[288]  Desmond Paul Henry,et al.  NOTE ON THE EXHIBITION OF LOGICAL MACHINES AT THE JOINT SESSION, JULY 1950 , 1951 .

[289]  W. Ulrich,et al.  Engineering multistage diode logic circuits , 1955, Electrical Engineering.

[290]  W. A. Clark,et al.  Simulation of self-organizing systems by digital computer , 1954, Trans. IRE Prof. Group Inf. Theory.

[291]  R. I. Van Nice.  Magnetic logic circuit control system design considerations , 1956 .

[292]  Marcel J. E. Golay.  The Logic of Bidirectional Binary Counters , 1957, IRE Trans. Electron. Comput..

[293]  Jan A. Rajchman,et al.  Ferrite Apertured Plate for Random Access Memory , 1956, Proceedings of the IRE.

[294]  D. D. Aufenkamp,et al.  Analysis of Sequential Machines II , 1957, IRE Trans. Electron. Comput..

[295]  A. Booth.  On optimum relations between circuit elements and logical symbols in the design of electronic calculators , 1952 .

[296]  D. E. Rosenheim,et al.  VHF Pulse Techniques and Logical Circuitry , 1957, Proceedings of the IRE.

[297]  A. Shimbel.  Applications of matrix algebra to communication nets , 1951 .

[298]  John N. Warfield.  Switching Circuits as Topological Models in Discrete Probability Theory , 1958, IRE Trans. Electron. Comput..

[299]  J. C. E. Dekker,et al.  A theorem on hypersimple sets , 1954 .

[300]  Haskell B. Curry,et al.  The combinatory foundations of mathematical logic , 1942, Journal of Symbolic Logic.

[301]  N. T. Grisamore,et al.  Logical Design Using the Stroke Function , 1958, IRE Trans. Electron. Comput..

[302]  Mao-Chao Chen.  A Magnetic Core Parallel Adder , 1958, IRE Trans. Electron. Comput..

[303]  Haskell B. Curry,et al.  A Theory Of Formal Deducibility , 1950 .

[304]  David A. Huffman.  The Design and Use of Hazard-Free Switching Networks , 1957, JACM.

[305]  D. D. Aufenkamp,et al.  On the Analysis of Sequential Machines , 1958, IRE Trans. Electron. Comput..

[306]  D. Engelbart.  A new all-magnetic logic system using simple cores , 1959 .

[307]  Byron O. Marshall,et al.  Optical elements for computers , 1952, ACM '52.

[308]  Raymond J. Nelson.  Shannon Claude E.. The synthesis of two-terminal switching circuits. The Bell System technical journal , vol. 28 (1949), pp. 59–98. , 1955 .

[309]  S. Huzino.  REDUCTION THEOREMS ON SEQUENTIAL MACHINES , 1958 .

[310]  J. Kemeny.  Man Viewed as a Machine , 1955 .

[311]  A. Church.  Special Cases of the Decision Problem , 1951 .

[312]  Zdzislaw Pawlak,et al.  Review: B. I. Aranovic, The Use of Matrix Methods in Problems of the Structural Analysis of Relay- Contact Networks , 1956, Journal of Symbolic Logic.

[313]  E. C. Nelson.  An algebraic theory for use in digital computer design , 1954, Trans. I R E Prof. Group Electron. Comput..

[314]  C. Y. Lee,et al.  Several-valued combinational switching circuits , 1956, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[315]  R. W. Aldrich,et al.  Multiterminal P-N-P-N Switches , 1958, Proceedings of the IRE.

[316]  Edwin Hirschhorn.  Simplification of a Class of Boolean Functions , 1958, JACM.

[317]  Gerard P. Weeg.  Folding of Symmetric Functions , 1958, IRE Trans. Electron. Comput..

[318]  R. W. Ketchledge.  Logic for a digital servo system , 1959 .

[319]  Shreeram Abhyankar,et al.  Minimal "Sum of Products of Sums" Expressions of Boolean Functions , 1958, IRE Trans. Electron. Comput..

[320]  Jan Kalicki.  A Test for the Equality of Truth-Tables , 1952, J. Symb. Log..

[321]  E. Sternglass,et al.  Transmission Secondary Electron Multiplication for High-Speed Pulse Counting , 1956, IRE Transactions on Nuclear Science.

[322]  D. Slepian.  A class of binary signaling alphabets , 1956 .

[323]  S. H. Washburn.  Relay “trees” and symmetric circuits , 1949, Electrical Engineering.

[324]  W. Miehle.  Link-Length Minimization in Networks , 1958 .

[325]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[326]  A. G. Ratz,et al.  A method of gating for parallel computers , 1951, Electrical Engineering.

[327]  Lars Svenonius.  Definability and Simplicity , 1955, J. Symb. Log..

[328]  S. Seshu.  On Electrical Circuits and Switching Circuits , 1956 .

[329]  N. Rouche.  Some Properties of Boolean Equations , 1958, IRE Trans. Electron. Comput..

[330]  B. D. Rudin.  A theorem on SPDT switching circuits , 1955, AFIPS '55 (Western).

[331]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[332]  R. L. Bright,et al.  Junction transistors used as switches , 1955, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[333]  W. C. Carter,et al.  A Comparison of Order Structures for Automatic Digital Computers , 1954, Oper. Res..

[334]  W. V. Quine,et al.  On ordered pairs , 1945, Journal of Symbolic Logic.

[335]  W. L. Poel,et al.  A simple electronic digital computer , 1952 .

[336]  A. W. Lo,et al.  Transistor Trigger Circuits , 1952, Proceedings of the IRE.

[337]  John N. Warfield.  A Note on the Reduction of Switching Functions , 1958, IRE Trans. Electron. Comput..

[338]  D. Mackay.  The Epistemological Problem for Automata , 1956 .

[339]  Werner Buchholz.  The System Design of the IBM Type 701 Computer , 1953, Proceedings of the IRE.

[340]  N. S. Mendelsohn,et al.  Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.

[341]  Irving S. Reed,et al.  Symbolic synthesis of digital computers , 1952, ACM '52.

[342]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[343]  Walter Oberschelp,et al.  Varianten von Turingmaschinen , 1958 .

[344]  Chaang Huang,et al.  Field effect transistor applications , 1955, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[345]  N. Nakagawa,et al.  On Evaluation of the Graph Trees and the Driving Point Admittance , 1958 .

[346]  Richard C. Jeffrey.  Arithmetical Analysis of Digital Computing Nets , 1956, JACM.

[347]  Michael Scriven,et al.  VI.—THE MECHANICAL CONCEPT OF MIND , 1953 .

[348]  Harry J. Gray.  Logical Description of Some Digital-Computer Adders and Counters , 1952, Proceedings of the IRE.

[349]  E. W. Veitch,et al.  A chart method for simplifying truth functions , 1952, ACM '52.

[350]  D. Slepian.  On The Number of Symmetry Types of Boolean Functions of n Variables , 1953, Canadian Journal of Mathematics.

[351]  C. J. Everett,et al.  Representations of Sequences of Sets , 1949 .

[352]  F. B. Fitch.  Representation of Sequential Circuits in Combinatory Logic , 1958, Philosophy of Science.

[353]  J. Wylen,et al.  Magnetic Core Circuits for Digital Data-Processing Systems , 1956, Proceedings of the IRE.

[354]  George Pólya,et al.  Sur les types des propositions composées , 1940, Journal of Symbolic Logic.

[355]  Allen Newell,et al.  Heuristic Problem Solving: The Next Advance in Operations Research , 1958 .

[356]  William Grey Walter,et al.  Possible features of brain function and their imitation , 1953, Trans. IRE Prof. Group Inf. Theory.

[357]  Arthur W. Burks,et al.  The Logic of Automata—Part I , 1957, JACM.

[358]  Raymond J. Nelson,et al.  Simplest normal truth functions , 1955, Journal of Symbolic Logic.

[359]  W. V. Quine,et al.  Logic based on inclusion and abstraction , 1937, Journal of Symbolic Logic.

[360]  A. Burks,et al.  Theory of Logical Nets , 1953, Proceedings of the IRE.

[361]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[362]  Rocco H. Urbano,et al.  A Topological Method for the Determination of the Minimal Forms of a Boolean Function , 1956, IRE Trans. Electron. Comput..

[363]  J. Calderwood,et al.  Pattern Recognition in the Synthesis of Complex Switching Systems , 1958 .