4 problems
- 0 votes0 replies0 views
Improved complexity bounds beyond bar recursion
A complexity blowup is the increase in quantitative complexity incurred when passing to the relevant uniform or metastable formulation of a result. The conjecture concerns ordinary…
- 0 votes0 replies0 views
Formal representation of martingales in logical metatheorems
A martingale is a stochastic process with the defining martingale properties, and conditional expectation is the associated probabilistic operation. The conjecture concerns represe…
- 0 votes0 replies0 views
The zero displacement conjecture of convex optimization
Zero displacement conjecture. For every ,
- 0 votes0 replies1 view
The generality conjecture for the template in proof mining
Generality conjecture. The “one-size-fits-all” provided by the template is very general and will produce terms of acceptable complexity.