An alternative way to study the rules of life-like cellular automata is presented. The proposed perspective studies some multifractal and informational properties of Boolean functions behind these rules. Results from this approach challenge the traditional argument about the simplicity of Lifelike rules.