Bricken is the fellow who discovered the "Bricken Basis":
A((B)) = AB
A() = ()
A(AB) = A(B)
This is the most parsimonious symbolic representation of Logic (yet found.) LoF with the Bricken basis is a more efficient notation than the standard ones. For example, it permits writing a SAT solver that does not require its inputs to be in normal form.[1] A proof in LoF notation is typically one or two orders of magnitude shorter than one using standard notation.
I'm pretty sure this stuff is the future of digital hardware.
http://iconicmath.com/logic/semiconductors/
http://iconicmath.com/mypdfs/15p-bricken.120903.pdf
Bricken is the fellow who discovered the "Bricken Basis":
This is the most parsimonious symbolic representation of Logic (yet found.) LoF with the Bricken basis is a more efficient notation than the standard ones. For example, it permits writing a SAT solver that does not require its inputs to be in normal form.[1] A proof in LoF notation is typically one or two orders of magnitude shorter than one using standard notation.I'm pretty sure this stuff is the future of digital hardware.
[1] http://joypy.osdn.io/notebooks/Correcet_Programming.html