Algorithmic Search in Group Theory
classification
🧮 math.GR
keywords
searchapproximationsgroupmethodtheoryalgorithmicapplicationsapplied
read the original abstract
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. The method is provably effective but not practical, so the applications involve heuristic approximations. Perhaps surprisingly, these approximations seem to work. Some experimental evidence is presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.