You probably want a fast algorithm.

Compare https://arxiv.org/abs/1108.1791 and why computational complexity is often more interesting that computability.

Sure, i guess i should have said something like with a polynomial circuit size or something.

However by the same token couldn't you use the same brute force approach with exp minus log?

What im really asking, are NAND gates really different here?