Convergence verification of the Collatz problem

David Barina

DOI:10.1007/s11227-020-03368-x

Corpus ID: 220294340

Convergence verification of the Collatz problem

@article{Barina2020ConvergenceVO,
  title={Convergence verification of the Collatz problem},
  author={David Barina},
  journal={The Journal of Supercomputing},
  year={2020},
  pages={1-8}
}

David Barina

Published 2020

Computer Science

The Journal of Supercomputing

This article presents a new algorithmic approach for computational convergence verification of the Collatz problem. The main contribution of the paper is the replacement of huge precomputed tables containing $$O(2^N)$$ O ( 2 N ) entries with small lookup tables comprising just O ( N ) elements. Our single-threaded CPU implementation can verify $$4.2 \times 10^9$$ 4.2 × 10 9 128-bit numbers per second on Intel Xeon Gold 5218 CPU computer, and our parallel OpenCL implementation reaches the speed… CONTINUE READING

View on Springer