User:Jaydavidmartin/Circuit complexity

In computational complexity theory, a circuit family is an infinite list of circuits that represents a formal language. Each circuit in the circuit family has a different input size.

A circuit family is said to decide a language $L$ if, for every string $w$, $w$ is in the language $L$ if and only if $C_{n}(w)=1$, where $n$ is the length of $w$. In other words, a language is the set of strings which, when applied to the circuits corresponding to their lengths, evaluate to 1