Boolean Primitives as Symmetric Boolean Functions

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

The Boolean functions And, Nand, Or, Nor, Xor, Xnor, Equivalent, and Majority are all special cases of the general symmetric function BooleanCountingFunction. This explores the equivalence by giving the implementation of the primitives in terms of arguments to BooleanCountingFunction and truth tables.

Contributed by: Roger Germundsson (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send