| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952108 | Theoretical Computer Science | 2017 | 26 Pages |
Abstract
In this article we suggest a new systematic approach to studying algorithms on algebraic structures via primitive recursion. The approach is designed to fill the gap between abstract computable structure theory and feasible (in the sense of polynomial-time, computational or automatic) algebra.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Iskander Kalimullin, Alexander Melnikov, Keng Meng Ng,