• DocumentCode
    886528
  • Title

    Characterization and Cardinality of Universal Functions

  • Author

    Menge, Karl S., Jr.

  • Author_Institution
    Electronic Systems Lab., M.I.T., Cambridge, Mass.
  • Issue
    5
  • fYear
    1965
  • Firstpage
    720
  • Lastpage
    721
  • Abstract
    Necessary and sufficient conditions that a Boolean function be universal, are established. It is demonstrated that most functions are in fact universal; thus, almost any function is a candidate for building the combinational logic of all computers.
  • Keywords
    Boolean functions; Contracts; Input variables; Logic; Sufficient conditions; Wires;
  • fLanguage
    English
  • Journal_Title
    Electronic Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0367-7508
  • Type

    jour

  • DOI
    10.1109/PGEC.1965.264213
  • Filename
    4038559