Bounded Analog Complexity

Ho-Lin Chen and Xiang Huang
32nd International Conference on DNA Computing and Molecular Programming
Fayetteville, Arkansas · August 3, 2026

• View or download the talk slides
• Read the paper

The talk develops a wall-clock notion of complexity for bounded analog computation and chemical reaction networks. It explains why trajectory length can hide meaningful differences in running time, then presents a compiler that replaces unbounded species with bounded polynomial dynamics.