Reproduce “Specification Complexity: Lower Bounds on What Must Be Said” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Hasbi Ash

The paper defines exact description complexity for objectives over two registers in a fixed formula language. It proves deterministic one-way communication complexity lower-bounds minimum formula size, but does not provide a converse. For odd parity of the first register, one bit decides membership, yet formula size is Θ(n²), exactly 2n²−1 for powers of two, under this language and size convention.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.