Inter- and intracellular computation models based on Boolean vs. non-Boolean inconsistency

Systems involving both intracellular and intercellular computation are destined to be described as non-computable. We propose a model for such systems by introducing the inconsistent relation of Boolean and non-Boolean logic. Cellular automata fashioned model exhibits an evolution like class 4 located at the edge of chaos, while there is no local rule for universality existing over the whole space in our model. A system featuring the inconsistent vertical scheme is approximately articulated into a hierarchical system, whose wholeness cannot be deduced by any approximated local rule. In other words, undecidability between a part and whole comprises a hierarchical structure.