Termination conjecture for the locus generation algorithm
Statement
Let the locus generation algorithm operate on a real algebraic locus, using complex detours around ramification points and sufficiently small steps on those detours. Termination conjecture. The locus generation algorithm terminates if it takes small enough complex detours and small enough steps on every complex detour. A proof of termination has remained elusive, although the successful application of Variant A in Cinderella supports 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.