OpenResearch

Reproduce “Many bounded versions of undecidable problems are NP-hard” on OpenResearch

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

Download for macOS

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

About this paper

Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma De las Cuevas

Read on alphaXiv

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