Abstract
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. Some experimental evidence as to the efficacy of the method is presented.
| Original language | English |
|---|---|
| Pages (from-to) | 237-244 |
| Number of pages | 8 |
| Journal | Journal of Algebra |
| Volume | 545 |
| DOIs | |
| State | Published - 1 Mar 2020 |
Keywords
- Asymptotic density
- Finitely presented groups
- Kolmogorov complexity
Fingerprint
Dive into the research topics of 'Algorithmic search in group theory'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver