The immediate meta-mathematical question is: how much circuit complexity can be accomplished inside PV1 ?
Statement
The immediate meta-mathematical question is: how much circuit complexity can be accomplished inside PV1 ? But a “constructive” proof of CSH remains unknown, and the existing arguments do not produce explicit hard functions. Formally, we ask: is CSH a theorem of PV1 ? Intuitively, despite our preliminary result, it remains open to “extract all the hardness” from a PV1 -proof of CSH. The report passage is retained verbatim as the relevant context for this extracted problem.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.