Constructive automata conjecture for Ising-model languages
Statement
Let be an Ising model and let be its language. A constructive PDA decides by accumulating the unary energy from local contributions and comparing it with the input energy; a constructive LBA accumulates the Hamiltonian energy on a designated tape in binary and accepts exactly when it agrees with the input.
Constructive automata conjecture. For every context free there exists a constructive PDA that decides it. For every context sensitive there exists a constructive LBA that decides it.
The claim says that the natural, function-computing condition imposed on the automata is not necessary for restricting the language classes: every language in the relevant class should admit such a constructive recognizer. The source gives no resolution of this conjecture.
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.