Let A be x&-x and B be -(x&-x): constant 0 and 1 functions with one input and one gate. Ia and Ib are empty set (right?) so their empty union can't witness the trivial non-equivalence.
I'm failing to construct a simple example for this. I think such A,B,Ia,Ib tuples must exist bc otherwise people would use that for equivalence checking. :) I'd like to use this for bug finding and am trying to better understand the limitations. Can anyone solve this?pic.twitter.com/rxPjNxNoDp
-
-
-
Related from 1967: http://ieeexplore.ieee.org/document/4038995/ … (apologies if I'm telling you something you already know)
End of conversation
New conversation -
-
-
Not sure I understand the definition of Ia and Ib completely, but maybe this rather trivial thing works. A(x,y) = (x,y), B(x,y) = (y,x). Can choose Ia = Ib = {(0,0), (1,1)}, but A equals B on all elements of Ia.
-
Oh, yeah! That works. Thanks!
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.