The mixing conjecture for transitive systems with intractable telic problems
Statement
Let be an efficiently discretizable topological dynamical system. Recall that a system is transitive when it has the stated topological transitivity property, and topologically mixing when it has the corresponding mixing property.
Mixing conjecture. If is transitive and admits an intractable telic problem, then the system is topologically mixing.
The conjecture proposes that computational intractability, together with transitivity, forces a stronger dynamical mixing property. The source 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.