Search results
Jump to navigation
Jump to search
Page title matches
- ...infinite arity and periodic truth table {{spaces|4}} <small>similar to {{w|Boolean expression}}</small> ...}} '''truth table''', '''TT''' {{spaces|4}} usually meant as a truth table of finite length, determined by an {{sect|arity}} ...13 KB (1,832 words) - 14:00, 11 March 2025
Page text matches
- Analogous to hard and soft [[properties of Boolean functions]], there are also hard and soft permutations. ...mutation is '''hard''', when the domain is the infinite set of all Boolean functions.<br> ...2 KB (240 words) - 12:46, 14 March 2025
- Functions in the same [[Equivalence classes of Boolean functions#NP|NP equivalence class]] (clan) have Euler diagrams with the same shape. The functions in it can be turned into each other with [[Studies of Euler diagrams/transformations|transformations]].<br> ...4 KB (542 words) - 23:16, 15 October 2023
- {{DISPLAYTITLE:Studies of Euler diagrams/<span style="font-family: Georgia, serif; font-style: italic ...11809}} <small>(all circles point to inside)</small><br>below those of its complement {{zhe|11808}} <small>(all circles point to outside)</ ...5 KB (610 words) - 18:29, 11 February 2023
- ...gebraic normal form}}''' ('''ANF''') is a {{w|canonical normal form}} of a Boolean function. It is a {{w|Eclusive or|XOR}} formula of {{w|Logical conjunction|AND}} formulas, like this: ...3 KB (509 words) - 23:24, 16 May 2024
- This class for Boolean functions (BF) is the biggest part of this software.<br> This project is related to many pages in [[Studies of Boolean functions]]. ...5 KB (723 words) - 16:08, 4 July 2024
- Boolean functions belong to the same family, when they can be [[Studies of Euler diagrams/transformations|transformed]] into each other by negating ar ...mal size is 2<sup>''{{Boolf-hard|adicity}}''</sup>, i.e. the period length of the truth table.<br> ...6 KB (980 words) - 01:21, 16 March 2025
- ::<small style="opacity: .5;">''These tables are in category {{c|Studies of Euler diagrams; templates; NP tables}}.''</small> ...of Boolean functions#P|permutation]] and [[Equivalence classes of Boolean functions#N|negation]] equivalence classes. ...7 KB (1,014 words) - 15:26, 23 February 2023
- ...re those who are their own [[Zhegalkin twins]], i.e. the binary expression of their [[Algebraic normal form|ANF]] is equal to their truth table.<br> They are all even, i.e. the first digit of their truth table is false.<br> ...9 KB (1,361 words) - 11:15, 18 May 2024
- ==Shape of the Euler diagram== ...th table AB.svg|500px]]<br>the four cells of bundle ''AB'' (outside of sets ''C'' and ''D'') ...5 KB (803 words) - 22:51, 26 June 2022
- | [[Studies of Euler diagrams/blighted|blighted]] {{Rdrup}} A Boolean function is '''bloated''', if some of its sets are equal or complementary to each other.<br> ...7 KB (989 words) - 21:42, 21 June 2023
- | [[Studies of Euler diagrams/blighted|blighted]] {{Rdrup}} A Boolean function is '''blotted''', if one of its sets is equal or complementary to the universe.<br> ...6 KB (775 words) - 18:39, 12 March 2023
- ...infinite arity and periodic truth table {{spaces|4}} <small>similar to {{w|Boolean expression}}</small> ...}} '''truth table''', '''TT''' {{spaces|4}} usually meant as a truth table of finite length, determined by an {{sect|arity}} ...13 KB (1,832 words) - 14:00, 11 March 2025
- ...an functions#NP|NP equivalence class]]), so they can be expressed in terms of each other.<br> ...pacity: .5; font-size: 80%;">The clan numbers refer to the [[4-ary Boolean functions; clans in rational order|rational ordering]]. (Which will at some point be ...13 KB (1,782 words) - 12:53, 26 April 2024
- ...all of the other operators in the subject matter variously described as [[boolean function]]s, monadic predicate calculus, [[propositional calculus]], senten ...<math>\mathbf{f}</math>, because it is necessarily false; while the value of <math>\underline {x \curlywedge y} \curlywedge \underline {x \curlywedge y} ...9 KB (1,221 words) - 08:46, 24 March 2023
- This is an extension of the class [[Discrete helpers/perm|Perm]] with added negators.<br> ...h>. <small>(See e.g. the [[full octahedral group]] for the 48 permutations of the cube.)</small><br> ...5 KB (589 words) - 16:49, 1 June 2024
- [[File:Venn 0101 0011.svg|thumb|The 3-ary Boolean function <math>\scriptstyle ( A \land \neg C ) \lor ( B \land C )</math> re [[File:Boolean functions like 1100 1010.svg|thumb|''sec'' 53 containing 8 functions, including the one shown above (shown in the top right position)]] ...80 KB (10,872 words) - 11:16, 17 May 2024
- ...a design choice. They could be called ''hard'' and ''soft''. On this page functions with hard gapspots are marked with ⚒. ...olor="#ddd" | [[Studies of Euler diagrams/gap variants/basiga|gap variants of {{boolfname|basiga}}]] ...11 KB (1,509 words) - 13:23, 3 July 2022
- ...ion (mathematics)|polyadic or finitary relation]], one in which the number of places in the relation is three. In other language that is often used, a t ...Therefore it will be useful to consider a few concrete examples from each of these two realms. ...20 KB (2,616 words) - 11:47, 25 November 2023
- ...0000 0001 0001 0110.png|thumb|280px|[[w:Venn diagram|Venn diagram]] of the Boolean function<br>0000 0001 0001 0110]] There are <math>2^{2^{4}}</math> = 65536 4-ary Boolean functions, which correspond to 16-bit binary strings. ...104 KB (7,501 words) - 11:49, 12 January 2025
- ...m states instead of the sequentially determined states, inputs and outputs of a ''sequential, or state machine'' . The precise mathematical definitions of quantum automaton*, variable automaton, and quantum [[../LQG2/|computation] ...15 KB (2,076 words) - 15:54, 12 September 2020