Tag
This paper introduces a tractable method to control autoregressive large language model generation to satisfy LR(k) context-free grammars in polynomial time, improving over exponential previous methods. It demonstrates that current LLMs often fail to generate sequences satisfying simple nested constraints, motivating the need for efficient constrained generation.
This paper argues that under semiclassical gravity, a massive qubit can solve NP-complete problems in polynomial time via nonlinear dynamics, implying gravity must be quantized.