Rice's theorem is a well-known result in the theory of recursive functions, A corresponding theorem for cellular automata limit sets is proved: All nontrivial properties of limit sets of cellular automata (CAs) are shown undecidable. The theorem remains valid even if only one-dimensional CAs are considered.