Boolean function
MyWikiBiz, Author Your Legacy — Friday November 08, 2024
Revision as of 00:56, 2 November 2011 by Jon Awbrey (talk | contribs) (Category:Charles Sanders Peirce)
☞ This page belongs to resource collections on Logic and Inquiry.
A finitary boolean function is a function of the form \(f : \mathbb{B}^k \to \mathbb{B},\) where \(\mathbb{B} = \{ 0, 1 \}\) is a boolean domain and where \(k\!\) is a nonnegative integer. In the case where \(k = 0,\!\) the function is simply a constant element of \(\mathbb{B}.\)
There are \(2^{2^k}\) such functions. These play a basic role in questions of complexity theory as well as the design of circuits and chips for digital computers.
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Boolean Function @ MyWikiBiz
- Boolean Function @ MathWeb Wiki
- Boolean Function @ NetKnowledge
- Boolean Function @ OER Commons
- Boolean Function @ P2P Foundation
- Boolean Function @ SemanticWeb
- Boolean Function @ Subject Wikis
- Boolean Function @ Wikiversity Beta
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
- Boolean Function, MyWikiBiz
- Boolean Function, MathWeb Wiki
- Boolean Function, PlanetMath
- Boolean Function, PlanetPhysics
- Boolean Function, Wikiversity Beta
- Boolean Function, Wikinfo
- Boolean Function, Textop Wiki
- Boolean Function, Wikipedia
<sharethis />
