got this sort of correctness type mismatch where algorithms can take an arbitrarily long input and circuits can only take in the fixed length inputs and there's a very easy way that complexity theorist came up with sort of unifying the two and the idea is to talk about a computational model called a circuit family the circuit family has is an infinite collection of circuits infinitely many and you have a circuit on one bit of input a circuit on two bits of input circuit on ten bits of input for every possible size of input