Uniformity and advice

Dropping uniformity permits circuit descriptions not generated by the required single efficient classical machine. That changes the theorem. Dropping the polynomial-size restriction as well permits exhaustive finite tables at every length.

Our partial family's uniformity is elementary because the only nonempty gate list is fixed at $\ell =4$. Its failure to solve the general problem is explicit, not hidden behind advice terminology.