Towards Parallel Evaluation and Learning of Boolean ...-Formulas with Molecules

Abstract

A ¯--formula is a Boolean formula in which each variable occurs at most once. The paper treats its molecular representation including its queries using techniques in molecular biology. The novelty is that this method can evaluate a Boolean formula in a single tube within a short time. The preliminary experimental result suggests the possibility of parallel evaluation and learning of general ¯--formulas. This method is essentially a simulation of state transitions and can be used to simulate a decision tree or a state machine. 1 Introduction From the beginning of molecular computation, its parallelism is what theoretical analyses are concerned with and what researchers have tried to fully utilize in lab experiments. Despite the initial optimism, however, researchers came to know pros and cons of molecular operations [11]. The most unfavorable is the instability of lab operations susceptible to temperature, concentration and enzyme activity. Another hurdle is the difficulty in realizing..