Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
We explore the possibility of using machine learning to identify interesting mathematical structures by using certain quantities that serve as fingerprints. In particular, we extract features from integer sequences using two empirical laws: Benford's law and Taylor's law and experiment with various classifiers to identify whether a sequence is, for example, nice, important, multiplicative, easy to compute or related to primes or palindromes.
Joseph Y. Halpern
aaai 1996
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
Jungo Kasai, Kun Qian, et al.
ACL 2019
Susumu Horiguchi, Takeo Nakada
Journal of Parallel and Distributed Computing