finite okay and then we can talk about if I want to compute some given function how many times do I have to take some previously computed bits and give up another but before I finally get the output of the function I want okay and so trying to minimize this as the number of little no gates you have in here is the core problem in certain complexity all right so most functions most require humongous circuits okay so a very old theorem of Shannon and matched by loop on/off says it with high probability if you randomly choose a function by just