Iterated Narrow Networks: Turing Completeness at Width 4 on Convex Input Spaces and the Complexity of Verification
cs.LG, cs.CC, cs.LO, cs.NE
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Understanding Deep Neural Networks with Rectified Linear Units
- Deep Equilibrium Models
- Approximating Continuous Functions by ReLU Nets of Minimal Width
- On Neural Differential Equations
- The Expressive Power of Transformers with Chain of Thought
- Minimum Width for Universal Approximation
- Highway Networks
- Complexity of Reachability Problems in Neural Networks
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis