Controllability of polynomial systems is undecidable and not recursively enumerable
math.OC, cs.CC, cs.SY, eess.SY
Submitted: 2026-10-19
Updated: 2026-10-19
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Beyond Aggregate Drift: Optimal Client-Specific Windows in Federated Learning
- Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
- Second-Order Optimization with Asynchronous Curvature