sentences:  Formally, for a formal language to belong to L/poly, there must exist an advice function that maps an integer to a string of length polynomial in , and a Turing machine M with two read-only input tapes and one read-write tape of size logarithmic in the input size, such that an input of length belongs to if and only if machine M accepts the input .Alternatively and more simply, is in L/poly if and only if it can be recognized by branching programs of polynomial size.One direction of the proof that these two models of computation are equivalent in power is the observation that, if a branching program of polynomial size exists, it can be specified by the advice function and simulated by the Turing machine.