Skip to main content

Switching the Engineer’s Mind-Set to Boolean: Applying Shannon’s Algebra to Control Circuits and Digital Computing (1938–1958)

  • Chapter
  • First Online:
  • 699 Accesses

Part of the book series: History of Computing ((HC))

Abstract

It belongs to the lore of computer science that Claude Shannon’s master’s thesis (1937) revolutionized the design of (relay) switching circuit design. However, as often is the case when taking a closer look at the historical records, things were slightly more complex. Neither was Shannon’s paper an isolated result in switching theory, nor was it immediately absorbed into the engineers’ daily practice. It proved to be only usable in a small number of situations and had to be used in conjunction with other techniques and the engineer’s know-how. Boolean algebra would only become more important and more generally useful once standard situations were created.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   44.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    “The paper was a landmark in that it helped to change digital circuit design from an art to a science” (Goldstine 1972, p. 120).

  2. 2.

    One of the major biases is the heroifying of John von Neumann, to the point of neglecting or underplaying contributions by others (especially in the context of ENIAC or the EDVAC design). But the most incorrect statement in the book may very well be “the state of numerical mathematics stayed pretty much the same as Gauss left it until World War II (p. 287),” for this alone the author should have deserved to be haunted by the ghosts of all mathematicians that have worked on numerical mathematics for the military, for industry, or for government well before World War II.

  3. 3.

    Today, most authors will not use this particular Boolean algebra but rather another one where 1 + 1 = 0. In that case, a closed relay corresponds to 1 and open to 0, with a serial circuit corresponding to multiplication and a parallel circuit to addition. Hartree 1949 was the first to suggest using this algebra.

  4. 4.

    For a rich documentation of early publications in algebraic switching theory, see the second part of (Stankovic and Astola 2011).

  5. 5.

    Note that this paper focuses on US reception, or more correctly, only a small part of it, mostly using materials coming from Bell Labs , MIT, and Harvard. The current paper, however, gives the general drift of Shannon’s reception in the USA. A more ambitious story (work in progress) should include not only a selection of East Coast sites but also other players in the field such as IBM or West Coast developments. Another restriction of the paper is that its sources used are mainly published papers, complemented with technical reports and patents. No use was made of Bell’s engineers’ notebooks or similar documents, which did not circulate.

  6. 6.

    The main results of the paper date from 1940, but the paper was only published after the war in 1949.

  7. 7.

    The team of Stibitz and Williams who developed the Bell relay calculators proceeded in a similar way, developing basic units for their calculators, but they never published on the topic.

  8. 8.

    See (Stankovic et al. 2016) for its reception in the Soviet Union .

  9. 9.

    The work of Moore, Mealy, and Huffman also sparked a new rapprochement between circuit design and information theory, especially coding theory. This constitutes another chapter in the history of (theoretical) circuit design, where automata theory, information theory, and circuit design meet. M. Mahoney’s work on the emergence of theoretical computer science provides an angle on that particular chapter, but his studies are based on theoretical publications, not on the actual practices.

  10. 10.

    Including von Neumann himself who used the notation in his lectures on probabilistic logic and the synthesis of reliable circuits from unreliable components.

  11. 11.

    Quine would later contribute an important result in logic directly useful for simplifying Boolean functions that were used in circuit design (Quine 1952).

References

  • Aiken, Howard H. (ed.). 1951. Synthesis of Electronic Computing and Control Circuits. Cambridge, Mass.: Harvard University Press.

    Google Scholar 

  • Association for Symbolic Logic. 1948. Tenth Meeting. Journal for Symbolic Logic, vol. 13 (1), 61–64.

    Google Scholar 

  • Caldwell, Samuel H. 1954. “The recognition and identification of symmetric switching functions”. Transactions of the AIEE, vol. 73, 142–146.

    Google Scholar 

  • Caldwell, Samuel H. 1958. Switching circuits and logical design. Cambridge, Mass.: MIT Press.

    MATH  Google Scholar 

  • Dinneen, G.P., Lebow, I.L. and Reed, I.S. 1958. “The Logical Design of CG 24” AFIPS proceedings Fall 1958, vol. 14, p. 91–94.

    Google Scholar 

  • Gilbert, E.N. 1951. “N-terminal switching circuits”. Bell System Technical Journal, vol. 30, pp. 668–688, 1951.

    Article  MathSciNet  Google Scholar 

  • Goldstine, Herman H. 1972. The computer, from Pascal to von Neumann. Cambridge, Mass.: MIT Press.

    MATH  Google Scholar 

  • Letter from D.R. Hartree to H.H. Goldstine about “various points in the EDVAC report”, August 24, 1945. This letter was made available to me by Thomas Haigh and Crispin Rope.

    Google Scholar 

  • Hartree, Douglas R. 1949. Calculating instruments and machines. Illinois.

    Google Scholar 

  • Hohn, Franz E. and Schissler, Robert L. 1955. “Boolean Matrices and the Design of Combinational Relay Switching Circuits”. Bell System Technical Journal, Vol. 34 (1), 177–202.

    Article  MathSciNet  Google Scholar 

  • Jeffrey, R.C. and Reed, I.S. 1952 The use of Boolean algebra in logical design. Engineering Note E-458-2, Digital Computer Laboratory, MIT, Cambridge, Massachusetts, April 1952.

    Google Scholar 

  • Karnaugh, M. 1953. “The map method for synthesis of combinational logic circuits.” Transactions of the AIEE, vol. 72, 593–599.

    MathSciNet  Google Scholar 

  • Keister, W.; Ritchie, A. and Washburn, S. 1951. The Design of Switching Circuits. New York: D. Van Nostrand Co., Inc.

    MATH  Google Scholar 

  • Martin, J.L. 1948. Solution of Relay and Switching Circuits through Symbolic Analysis. Master’s thesis, Georgia School for Technology.

    Google Scholar 

  • Mealy, George H. 1955. “A Method for Synthesizing Sequential Circuits.” Bell Systems Technical Journal, Vol. 34 (5), 1045–1081.

    Article  MathSciNet  Google Scholar 

  • Moore, Edward F. 1956. “Gedanken-experiments on sequential machines.” In Automata Studies, edited by C.E. Shannon et J. McCarthy, Princeton: Princeton University Press, 129–153.

    Google Scholar 

  • Moore, Edward F. 1958. “Review of Caldwell, Switching circuits and logical design.” Journal of Symbolic Logic, 23 (4), 433–434.

    Google Scholar 

  • Quine, Willard V. 1952. “The problem of simplifying truth functions.” American Mathematical Monthly, vol. 59, 521–531.

    Article  MathSciNet  Google Scholar 

  • Roch, Axel 2010. Claude E. Shannon. Spielzeug, Leben und die geheime Geschichte seiner Theorie der Information. Berlin: gegenstalt.

    Google Scholar 

  • Shannon, Claude E. 1938. “A symbolic analysis of relay and switching circuits.” Transactions of the American Institute of Electrical Engineers, Vol. 57, 713–723.

    Article  Google Scholar 

  • Shannon, Claude E. 1949. “The Synthesis of Two Terminal Switching Circuits.” Bell System Technical Journal, Vol. 28 (1), 59–98.

    Article  MathSciNet  Google Scholar 

  • Shekel, Jacob. 1953. “Sketch for an Algebra of Switchable Networks.” Proceedings of the IRE, 41 (7), 913–921.

    Article  Google Scholar 

  • Staehler, R.E. 1952. “An Application of Boolean Algebra to Switching Circuit Design.” Bell Systems Technical Journal, Vol. 31 (2), 280–305.

    Article  MathSciNet  Google Scholar 

  • Stankovic, Radomir S., Astola, Jaakko (eds.). 2011. From Boolean Logic to Switching Circuits and Automata. Towards Modern Information Technology. New York, Berlin: Springer.

    Google Scholar 

  • Stankovic, Radomir S.; Astola, Jaakko; Shalyto, Anatoly A. S; and Strukov, Alexander V. (eds.). 2016. Reprints from the Early Days of Information Sciences, Early Work in Switching Theory and Logic Design in USSR. Tampere International Center for Signal Processing, Tampere University of Technology, Tampere, Finland, TICSP no. 66.

    Google Scholar 

  • Mai Sugimoto. 2010. “Making Computers Logical: Edmund Berkeley’s promotion of logical machines.” SIGCIS 2010 Workshop, Work in progress.

    Google Scholar 

  • Vérin, H. 1993. La gloire des ingénieurs. L’intelligence technique du XVIe au XVIIIe siècle. Paris: Albin Michel.

    Google Scholar 

  • Washburn, S.H. 1953. “An application of Boolean algebra to the design of electronic switching circuits.” Transactions of the AIEE, vol. 72, 380–388.

    Google Scholar 

  • Weste, Neil and Harris, David, 2011. CMOS VLSI Design: A Circuits and Systems Perspective (4th Edition). Boston (MA): Addison-Wesley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maarten Bullynck .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bullynck, M. (2019). Switching the Engineer’s Mind-Set to Boolean: Applying Shannon’s Algebra to Control Circuits and Digital Computing (1938–1958). In: Haigh, T. (eds) Exploring the Early Digital. History of Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-02152-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02152-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02151-1

  • Online ISBN: 978-3-030-02152-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics