Register | Login | |||||
Main
| Memberlist
| Active users
| Calendar
| Chat
| Online users Ranks | FAQ | ACS | Stats | Color Chart | Search | Photo album |
| |
0 users currently in Programming. |
Acmlm's Board - I3 Archive - Programming - Custom Bitwise Truth Tables | New poll | | |
Add to favorites | Next newer thread | Next older thread |
User | Post | ||
Guy Perfect Since: 11-18-05 Last post: 6434 days Last view: 6432 days |
| ||
Just as an experiment (and because I was bored), I decided to attempt to create logical functions that generated each of the 16 possible truth tables given two operands. What I came up with is the following:
A = 1100 Xor is Exclusive Or, Eqv is Equivalence and Imp is Implication (which I have no idea what the logic is behind it). They're only used once in the left-hand column, but an equivalent exp I am uncertain if my right-hand equivalents can be optimized, but I'm fairly certain the left-hand column is as good as it gets. (edited by Guy Perfect on 09-18-06 11:47 PM) |
|||
Jagori 150 Since: 11-17-05 Last post: 6433 days Last view: 6433 days |
| ||
I haven't looked at your table, but for the record, "implication" means "if A then B". If A and B are the inputs, then it works out like so:
A = 1, B = 1: A=>B holds (1) A = 1, B = 0: A=>B doesn't hold (0) A = 0, B = 1: A=>B is trivially true (1) A = 0, B = 0: same as above (1) |
Add to favorites | Next newer thread | Next older thread |
Acmlm's Board - I3 Archive - Programming - Custom Bitwise Truth Tables | | |