The paper's 'novel' stopping-time algorithm is the standard skip-all-powers-of-two Collatz acceleration, and its O(log n) worst-case claim is an unsupported fit to small-range data.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach
The paper's 'novel' stopping-time algorithm is the standard skip-all-powers-of-two Collatz acceleration, and its O(log n) worst-case claim is an unsupported fit to small-range data.