Limitations on counting in Boolean circuits and self-assembly
Tristan St\'erin, Damien Woods

TL;DR
This paper proves fundamental limitations on the ability of certain Boolean circuit models and self-assembly systems to count up to 2^n, highlighting the features needed for maximal counting capabilities.
Contribution
It introduces a new Boolean circuit model and shows its limitations in counting, then applies these results to self-assembly systems, explaining their counting constraints.
Findings
The n-wire local railway circuit model cannot count to 2^n.
Self-assembly systems within this model cannot implement certain bijective functions.
Experimentally-implemented systems can count to 2^n, but the studied model cannot.
Abstract
In self-assembly, a -counter is a tile set that grows a horizontal ruler from left to right, containing columns each of which encodes a distinct binary string. Counters have been fundamental objects of study in a wide range of theoretical models of tile assembly, molecular robotics and thermodynamics-based self-assembly due to their construction capabilities using few tile types, time-efficiency of growth and combinatorial structure. Here, we define a Boolean circuit model, called -wire local railway circuits, where parallel wires are straddled by Boolean gates, each with matching fanin/fanout strictly less than , and we show that such a model can not count to nor implement any so-called odd bijective nor quasi-bijective function. We then define a class of self-assembly systems that includes theoretically interesting and experimentally-implemented systems that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced biosensing and bioanalysis techniques · DNA and Biological Computing · Modular Robots and Swarm Intelligence
