It’s relatively easy to see that we cannot compute an arbitrary Boolean function using only AND and OR gates. For example, even the NOT function cannot be computed using only those gates (why?).
Can we build a circuit to compute an arbitrary Boolean function using a constant number of NOT gates?
Solution to the “42 code golf” problem
This was my best result:
It would have been nice to find a solution under 80 bytes but, after one hour of trying, that was the best I could manage…