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.
Termination of Linear Loops over the Integers (Track B: Automata, Logic, Semantics, and Theory of Programming)
1 Pith paper cite this work, alongside 7 external citations. Polarity classification is still indexing.
1
Pith paper citing it
7
external citations · OpenAlex
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.