We describe a simplified explanation of photosynthesis. We characterise the complexity of photosynthesis by interpreting its chemical equation as a language acceptance problem. A model of computation is generalised from our description of photosynthesis. It is then proved that this model is Turing universal. An instance of the model is constructed that acts like photosynthesis.
Keywords: unconventional model of computation, computability, computational complexity, photosynthesis.