ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A constraint satisfaction or optimization problem is a computational problem whose feasible assignments or candidate solutions can be evaluated by its constraints or objective function. A dynamical system is a system with an invariant measure, and a map between problems and dynamical systems is one-to-one when distinct problems correspond to distinct dynamical systems. Invariant-measure encoding conjecture. There always exist one-to-one maps from constraint satisfaction or optimization problems to dynamical systems such that the onset of hardness is captured by the underlying invariant measure. Such a correspondence would connect computational hardness with measurable dynamical behavior; the source presents this as one of three conjectures for future work and gives no resolution.

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.