Self-assembly and differentiation as models of computability

An idealization of chemical combination is formulated as a model of computability, and it is shown that this model has universal computational power just in case assembly has at least two-dimensional space in which to occur. It is also shown that this model, under reinterpretation, corresponds to a cellular automaton in which growth occurs by differentiation only (i.e., the state into which any cell is born is thereadfter fixed). Hence this latter model of growth is also computationally universal.