Unifying Lower Bounds for Algebraic Machines Using Topological Entropy

This paper introduces a novel method for proving lower bounds in algebraic complexity theory using the concept of topological entropy from dynamical systems theory. This method provides a unifying framework for understanding and generalizing existing lower bound results for various algebraic models of computation, including algebraic decision trees, algebraic computation trees, and parallel random access machines (PRAMs).