On plant roots logical gates

Theoretical constructs of logical gates implemented with plant roots are morphological computing asynchronous devices. Values of Boolean variables are represented by plant roots. A presence of a plant root at a given site symbolises the logical True, an absence the logical False. Logical functions are calculated via interaction between roots. Two types of two-inputs-two-outputs gates are proposed: a gate 〈x, y〉 → 〈xy, x + y〉 where root apexes are guided by gravity and a gate 〈x,y〉→〈x¯y,x〉 where root apexes are guided by humidity. We propose a design of binary half-adder based on the gates.