On Ladders´ complexity mechanism and quantitative regulation of scalable molecular computers by Rho family GTPases

We propose a new bio-molecular computing method based on Rho family GTPases, and report that the Ladders´ complexity increasing phenomenon is observed when molecular computing by Rho family GTPases is applied to solve large-scale 3-SAT problems. We also present the optimal condition for the regulation scheme as Pg=h Pl/Ql where Pg is the probability of global communication among the sub-pathways, Pl is the probability of local communication in the sub-pathways within the domain of the neighborhood, and h is the experimental coefficient dependent on the temperature, kinase activity and sorts of cells.