The Morse–Smale telic-problem tractability conjecture
Statement
Let be an efficiently discretizable Morse–Smale dynamical system. A telic problem coming from the system is an associated decision problem, and denotes the class of problems decidable in polynomial time.
Morse–Smale tractability conjecture. Every telic problem coming from the system is contained in .
The conjecture concerns the computational complexity of telic problems for efficiently discretizable systems. The source presents it as a proposed direction for further development 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.