Undecidability conjecture for the generalized Collatz problem qn+1
Statement
Let be an odd integer with , let be a positive integer in , and let be the modified Collatz general function. Undecidability conjecture for the algorithm . There is no algorithm which, given and , determines whether there exists a positive integer such that
This conjecture concerns the possible undecidability of the generalized Collatz problem; the paper presents it as an open problem motivated by Conway's undecidability theorem for generalized Collatz functions.
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.