ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Which subrings R_W\subset\mathbb Q have an HTP-complete polynomial, meaning one that uniformly encodes the solvability in R_W of every polynomial equation over \mathbb Q, and which have an effectively HTP-complete polynomial with a computable encoding map?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.