Abstract

In this paper, we employ techniques of machine learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether artificial intelligence (AI) can “learn” algebraic structures. Using finite groups and finite rings as a concrete playground, we find that questions such as identification of simple groups by “looking” at the Cayley table or correctly matching addition and multiplication tables for finite rings can, at least for structures of small size, be performed by the AI, even after having been trained only on small number of cases. These results are in tandem with recent investigations on whether AI can solve certain classes of problems in algebraic geometry.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call