Difference between revisions of "Boolean function"
MyWikiBiz, Author Your Legacy — Wednesday November 13, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (standardize syllabus & add document history) |
Jon Awbrey (talk | contribs) (cats) |
||
| Line 57: | Line 57: | ||
<br><sharethis /> | <br><sharethis /> | ||
| + | [[Category:Inquiry]] | ||
| + | [[Category:Peer Educational Resource]] | ||
[[Category:Combinatorics]] | [[Category:Combinatorics]] | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
Revision as of 04:39, 3 May 2010
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
Logical operators
Template:Col-breakTemplate:Col-breakTemplate:Col-endRelated topics
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.
<sharethis />
