is there some input which will make it print one okay that would usually when something makes it print one we call it a satisfying assignment and that's the origin of satisfiability but really want to know Jesus is it computing a trivial function or not so just tell me that okay so a circuit set is a so-called np-complete problem and so it's very unlikely to be solvable efficiently okay unless P equals NP okay like this so probably we're not going to be able to solve this circuit analysis problem very well but we could ask still if there is