Their paper is also free to read on arXiv: https://arxiv.org/abs/1907.00205 https://arxiv.org/abs/1907.00205 "We present two algorithms that proved useful in

Their paper is also free to read on arXiv: https://arxiv.org/abs/1907.00205 https://arxiv.org/abs/1907.00205 "We present two algorithms that proved useful in finding conjectures: a Meet-In-The-Middle (MITM) algorithm and a Gradient Descent (GD) tailored to the recurrent structure of continued fractions. Both algorithms are based on matching numerical values and thus they conjecture formulas without providing proofs and without requiring prior knowledge on any underlying mathematical structure. This approach is especially attractive for constants for which no mathematical structure is known, as it reverses the conventional approach of sequential logic in formal proofs. Instead, our work supports a different approach for research: algorithms utilizing numerical data to unveil mathematical structures, thus trying to play the role of intuition of great mathematicians of the past, providing leads to new mathematical research." For a live version on which you can comment and discuss with your peers and other readers, see this link on SciHive: https://www.scihive.org/paper/1907.00205 https://www.scihive.org/paper/1907.00205