Circuits: Weaker conditions, but similar to turbo integrity?

A calculation model is called full turing if it can simulate any turing machine.

This rules out, for example, a combinational logic circuit.

However, there are a sense in which the combinational logic circuits can solve all the problems that the turing machines can: although it is not the case, we can find for the Turing machine a circuit that calculates the same function $ {0,1 } ^ * to {0,1 } $ as T, however, is the case that we can find for each $ n $, a circuit that calculates the same function. $ {0,1 } ^ n to {0,1 } $ how does T for size tickets $ n $.

Is there a term to determine if a calculation model can calculate the same functions as the arbitrary turingo machines in this less restrictive sense?