☞ This page belongs to resource collections on Logic and Inquiry.
A finitary boolean function is a function of the form where is a boolean domain and where is a nonnegative integer. In the case where the function is simply a constant element of
There are 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
Peer nodes
Logical operators
|
|
Related topics
|
|
|
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.
This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.