Is it true that all languages which have polynomial circuits are in PSPACE?
Some languages in P/poly are undecidable. For example, any language over the alphabet {a} is in P/poly because for any string length n, either an is in the language or it is not, so the advice string for length n can just be whether or not to accept the string. However, there are uncountably many languages over this alphabet and only countably many Turing machines, so infinitely many of these languages are undecidable.

Every language in PSPACE is, by definition, decidable. Therefore, PSPACE &ne; P/poly.

Hope this helps!