Reproduce “Postselection on Halting and Reductions to the Halting Problem” 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

Saman Farhat, Farzad Didehvar

Farhat and Didehvar show that probabilistic machines decide languages by conditioning answers on eventual halting: runs that never halt contribute no answer. For the halting problem, an example has conditional correctness 1 when the program never halts and 3/5 when it does. Strict majority characterizes adaptive halting-oracle computation, even with any fixed rational halting-probability floor below 1.

Summary by alphaXiv.

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