Map Index Random Help

## QuoteRef: shanCE6_1938

topics > all references > ThesaHelp: references sa-sz

ThesaHelp:
references sa-sz
Topic:
history of computers
Topic:
automation
Topic:
networks of relays
Topic:
logic
Topic:
computer architecture
Topic:
algorithmic complexity analysis
Group:
formalism

#### Reference

Shannon, C.E., "A symbolic analysis of relay and switching circuits", Transactions of the American Institute of Electrical Engineers, AIEE Summer Convention, Washington, D.C., USA, June 1938, 57, pp. 38-80. Google

#### Other Reference

Shannon, C.E., M.S. Thesis, Department of Electrical Engineering, M.I.T.

Quotations
 471 ;;Quote: networks of relays and switches used for control and protective circuits for telephone exchanges, industrial motor-control, and other automated tasks 471+;;Quote: analyze and simplify relay networks as equations; equivalent to calculus of propositions; produces minimal, series and parallel networks 472 ;;Quote: use truth tables to prove theorems about hindrances, i.e., open or closed circuits; e.g., associative and distributive laws 473 ;;Quote: X' is the negative of X, i.e., the break contacts of a relay; X+X'=1 474 ;;Quote: perfect analogy between calculus of switching circuits and Boolean logic; Huntington's postulates and De Morgan's theorem 476 ;;Quote: series-parallel circuits equivalent to expressions of addition, multiplication, and negation 476+;;Quote: simplify series-parallel circuits by using Shannon's theorems to reduce the number of letters in the expression 482 ;;Quote: sequential circuits built with XY'=0; Y can operate only if X is operated 483 ;;Quote: a lock-in circuit is X=RX+S; X operates from R closing to S opening 484 ;;Quote: the maximal series-parallel circuits are sum_over_n of X_k and its inverse; O(2^n) elements 490 ;;Quote: how to construct a relay switching circuit from equations of the independent and dependent variables 492 ;;Quote: can use relay circuits for complex mathematical operations; anything using a finite number of steps of 'if', 'or', 'and', etc.; e.g., adding two numbers

Related Topics

ThesaHelp: references sa-sz (237 items)
Topic: history of computers (66 items)
Topic: automation (15 items)
Topic: networks of relays (27 items)
Topic: logic (84 items)
Topic: computer architecture (44 items)
Topic: algorithmic complexity analysis (10 items)
Group: formalism   (9 topics, 473 quotes)

Collected barberCB 9/03