Jump to content

Switching function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 21:22, 9 July 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In Boolean algebra, a switching function is a function that maps n binary variables to a single binary value. Typically it is thought of as assigning 0 or 1 to each binary sequence of length n.