Sugar-based Molecular Computing by Material Implication

A method to integrate an (in principle) unlimited number of molecular logic gates to construct complex circuits is presented. Logic circuits, such as half‐ or full‐adders, can be reinterpreted by using the functional completeness of the implication function (IMP) and the trivial FALSE operation. The molecular gate IMP is represented by a fluorescent boronic acid sugar probe. An external wiring algorithm translates the fluorescent output from one gate into a chemical input for the next gate on microtiter plates. This process is demonstrated on a four‐bit full adder. Logic gates with sugar and light: A molecular IMP (implication function) gate can be constructed with a boronic acid sugar probe which gives a fluorescent signal as an output. An external wiring algorithm translates the fluorescent output from one gate into a chemical input for the next gate on microtiter plates. This process is demonstrated on a four‐bit full adder.