Proving Incompleteness n NAND is a complete system
- Slides: 38
Proving Incompleteness n {NAND} is a complete system n Is {XOR, 0} a complete system?
Intuition X 0 0 1 1 Y 0 1 X’Y + Y’X XOR(X, Y) 0 1 1 0
Intuition X 0 0 1 1 Y 0 1 XOR(X, Y) 0 1 1 0 xor(X, Y) = xor(Y, X)
Intuition • xor(X, Y) = xor(Y, X) • xor(x, x) = 0 • xor(x, 0) = x A single layer circuit that includes {XOR, 0} cannot produce the gate not(X) X Y XOR(X, Y) 0 0 1 1 1 0
Proof for n-layered circuit A circuit with minimal number of gates X 0 X Something is going on Here
Proof for n-layered circuit Case A: the other input is 0 A circuit with minimal number of gates X 0 Something is going on Here
Proof for n-layered circuit Case A: the other input is 0 A circuit with minimal number of gates X X 0 Something is going on Here Contradiction to minimality!!! X
Proof for n-layered circuit Case B: the other input is X A circuit with minimal number of gates 0 X X Something is going on Here Contradiction to minimality!!! 0
Proof for n-layered circuit (II) Proof in induction n For circuit with 1 layer we already prooved. n Induction assumption: n n There is not circuit with n layers that can produce not with xor and 0. Proof that there is no circuit with n+1 layers that implements not with xor.
Proof in induction for n-layered circuit A circuit with n+1 layer X 0 X Something is going on Here
Proof in induction for n-layered circuit A circuit with n+1 layer 0 X Something is going on Here Change to circuit with n layers using similar consderations A proof using the induction assumption.
Minimizing to sum of products and product of sums X 0 0 1 1 Y 0 0 1 1 Z 0 1 0 1 F 0 1 1 0 0 1 How to write in minimal form?
When do we minimize? ABC + ABC’ = AB(C+C’) = AB When there are two terms that differ in only one literal!!
Minimizing to sum of products X 0 0 1 1 Y 0 0 1 1 Z 0 1 0 1 F 0 1 1 0 0 1 = X’Y’Z + X’YZ’ + XY’Z’ + XYZ Nothing to minimize!
Minimizing to product of sums X 0 0 1 1 Y 0 0 1 1 Z 0 1 0 1 F 0 1 1 0 0 1 F’ = X’Y’Z’ + X’YZ+XY’Z + XYZ’ Nothing to minimize!
The table Method: Example Minimize : F = w’x’y’z’ + w’x’y’z + w’x’yz’ + wx’y’z’ + wx’yz + wxyz’ + wxyz Very difficult!!
The table method for minimizing ABC + ABC’ ABC + AB’C’
The table method for minimizing ABC + ABC’ ABC + AB’C’ 111 110 100
The table method for minimizing ABC + ABC’ AB C + AB’C’ 111 110 7 - 6 =1 100 7 - 4 =3
The table method for minimizing ABC + ABC’ AB C + AB’C’ 111 110 7 - 6 =1 20 100 7 - 4 =3 We can minimize only if the difference is a power of 2
The table method for minimizing ABC + ABC’ AB C + AB’C’ 111 110 7 - 6 =1 20 100 7 - 4 =3 We can minimize only if the difference is a power of 2 IS IT SUFFICIENT? No
The table method for minimizing AB’C + A’BC 101 0 11 5 - 3 =2 21
The table method for minimizing AB’C + A’BC 101 0 11 5 - 3 =2 22 We can minimize only if the difference is a power of 2 and the number of 1 is different!
The table Method: Example Minimize : F = w’x’y’z’ + w’x’y’z + w’x’yz’ + wx’y’z’ + wx’yz + wxyz’ + wxyz = (0, 1, 2, 8, 10, 11, 14, 15)
The table method 0 1 2 8 10 11 14 15 w 0 0 0 1 1 1 xyz 000 001 010 000 011 110 111
The table method 0 1 2 8 10 11 14 15 w 0 0 0 1 1 1 xyz 000 001 010 000 011 110 111 0, 2 0, 8 2, 10 8, 10 10, 11 10, 14 11, 15 14, 15 wxyz 0 000 0– 0 - 0 00 - 0 10 1 0 - 0 1 011 -10 1 -11 1 11 -
The table method 0, 1 0, 2 0, 8 2, 10 8, 10 10, 11 10, 14 11, 15 14, 15 wxyz 0 000 0– 0 - 0 00 - 0 10 1 0 - 0 1 011 -10 1 -11 1 11 - 0, 2, 8, 10 0, 8, 2, 10 10, 11, 14, 15 10, 14, 11, 15 wxyz - 0– 0 - 0 -0 1 -1 -
The table method n The minimal term: F = w’x’y’ + x’z’ + wy
The table method - faster 0 1 2 8 10 11 14 15 0, 1 (1) 0, 2 (2) 0, 8 (8) 2, 10 (8) 8, 10 (2) 10, 11 (1) 10, 14 (4) 11, 15 (4) 14, 15 (1) 0, 2, 8, 10 (2, 8) 0, 8, 2, 10 (2, 8) 10, 11, 14, 15 (1, 4) 10, 14, 11, 15 (1, 4)
Choosing Minimal term F= (1, 4, 6, 7, 8, 9, 10, 11, 15)
The minimal terms 0000 0100 1000 0110 1001 1010 0111 1011 1111 1 4 8 6 9 10 7 11 15 1, 9 (8) 4, 6 (2) 8, 9 (1) 8, 10 (2) 6, 7(1) 9, 11 (2) 10, 11(1) 7, 15 (8) 11, 15 (4) 8, 9, 10, 11 (1, 2)
The minimal function F = x’y’z + w’xz’ + w’xy + xyz + wx’ Is it really the minimum ? No
The minimal function All the three account for Minterms 7, 15 – maybe we can dispose one of them? F = x’y’z + w’xz’ + w’xy + xyz + wx’ Is it really the minimum ? No
Essential Primary Element 1 x’y’z 1, 9 w’xz’ 4, 6 w’xy 6, 7 Xyz 7, 15 Wyz 11, 15 Wx’ 8, 9, 10, 11 4 6 7 8 X 9 10 11 15 X X X X
Essential Primary Element 1 x’y’z 1, 9 w’xz’ 4, 6 w’xy 6, 7 Xyz 7, 15 Wyz 11, 15 Wx’ 8, 9, 10, 11 4 6 7 8 X 9 10 11 15 X X X X
Essential Primary Element 1 x’y’z 1, 9 w’xz’ 4, 6 w’xy 6, 7 Xyz 7, 15 Wyz 11, 15 Wx’ 8, 9, 10, 11 4 6 7 8 X 9 10 11 X X X X X V 15 X V X X X
Choosing the other Essential Primary Element 1 x’y’z 1, 9 w’xz’ 4, 6 w’xy 6, 7 Xyz 7, 15 Wyz 11, 15 Wx’ 8, 9, 10, 11 4 6 7 8 X 9 10 11 X X X X V 15 V V X X V V X
The minimal function is F = x’y’z + w’xz’ + wx’ + xyz
- Arithmoquine
- Godel's theorem
- Incompleteness theorem
- Godel's theorem
- Tfyx
- Godel's incompleteness theorem
- Complete the missing word to complete the three key words
- Simple subject and predicate
- Gate level minimization
- Dominos
- And gate truth table
- Nand gate with relays
- Pmos nand
- A nor b
- Timing diagram of or gate
- Circuito logico
- Nand 2 tetris
- Dynamic shift register
- 2 input nand gate using pass transistor logic
- Boolean expression for or gate
- 2 input nand gate using pass transistor logic
- Nand flash data retention
- Nand
- Operation of ttl nand gate
- Tabel kebenaran gerbang logika and
- Python logic gates
- Multilevel nand gate
- Manchester adder
- Eqv gate
- Nand to xor gate conversion
- 3 input nand layout
- Tabel kebenaran nand 3 input
- Fungsi gerbang or
- When using dual symbols in a logic diagram,
- Nand
- Read disturb
- Nand gate
- Nand page buffer
- Nand