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 View the MathML source〈x,y〉→〈x¯y,x〉 where root apexes are guided by humidity. We propose a design of binary half-adder based on the gates.
On plant roots logical gates / Adamatzsky, A.; Baluska, F.; Mancuso, Stefano; Sirakoulis, G.C.; Martínez, G.J.. - In: BIOSYSTEMS. - ISSN 0303-2647. - STAMPA. - 156:(2017), pp. 40-45. [10.1016/j.biosystems.2017.04.002]
On plant roots logical gates
Mancuso, Stefano;
2017
Abstract
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 View the MathML source〈x,y〉→〈x¯y,x〉 where root apexes are guided by humidity. We propose a design of binary half-adder based on the gates.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.