The languages whose length- indicator functions have Boolean circuits with at most gates for sufficiently large , over a fixed bounded-fan-in complete basis. The family need not be constructible by one algorithm. Polynomial-size bounds give P/poly; the truth-table upper bound for circuit size applies even to undecidable languages.
New to topics? Read the docs here!