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