Fast Fourier Transform with Booleans
I had a program that produced boolean expressions with thousands of variables and operations, pages upon pages of stuff like
"… ⋁ (¬A473 ⋀ B732) ⋁ (A232 ⋀ ¬C987) ⋁ …", certainly not human-readable.
The generator started off being pretty buggy. How was I to find a bug in such a generator?
Tangent: Robert Freidson told me that I was fucked in the head.