The standard Floyd–Warshall is fairly easily parallelizable. I wonder how fast you could solve this problem with today's GPUs, and whether a(6) might be attainable in some reasonable time.
Could one do this directly with transistors or standard cells? Seems very useful for ASICs, particularly structured ASICs which are mapped from FPGA lookup tables of size 4-6.
This isn't quite as useful in practice as it seems, since NOT isn't always free, you almost always can eliminate common subexpressions, and gates with more than two inputs are often cheaper than doing everything with two-input gates.
The example parity function for 3 variables appears to be flipped. Instead of being true if the number of true inputs is odd, it's true if the number of true inputs is even.
Using the * operator for AND is very non-standard. Unicode provides ¬ for negation, ∧ for conjunction and ∨ for disjunction. These are commonly used in CS literature, along with bar(s) over variables or expressions to denote negation, which are definitely a mixed bag for readability.
It is not so uncommon to see it represented by a dot. I guess a star is like a dot, but doesn’t require finding any weird keys. It isn’t ideal but it is obvious enough what they mean.
OscarCunningham|8 months ago
AaronFriel|8 months ago
https://en.m.wikipedia.org/wiki/Karnaugh_map
Sharlin|8 months ago
dooglius|8 months ago
o11c|8 months ago
lilyball|8 months ago
fallat|8 months ago
senderista|8 months ago
cluckindan|8 months ago
_kb|8 months ago
Boolean algebra then use product, sum, and complement [2].
Both can express the same thing. In this case `*` is easier to type than `·`.
[1]: https://simple.industries/notes/propositions.html
[2]: https://simple.industries/notes/boolean-algebra.html
dse1982|8 months ago
bee_rider|8 months ago
unknown|8 months ago
[deleted]