Termination of one-variable linear-constraint loops over integers is decidable in polynomial time if the generalized Collatz conjecture holds, with any such procedure also settling specific instances of the conjecture.
Terminator: Beyond Safety
1 Pith paper cite this work, alongside 77 external citations. Polarity classification is still indexing.
1
Pith paper citing it
77
external citations · Crossref
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Loop Termination and Generalized Collatz Sequences
Termination of one-variable linear-constraint loops over integers is decidable in polynomial time if the generalized Collatz conjecture holds, with any such procedure also settling specific instances of the conjecture.