 In other words, any problem that can be computed in polynomial time by a deterministic Turing machine can also be computed by a polynomial-size circuit family.It is further the case that the inclusion is proper (i.e.Pformula_18P/poly) because there are undecidable problems that are in P/poly.