Name
Abstract | ||
|---|---|---|
•Machine model allows as primitive steps update operations realised by an automatic function.•Resulting complexity class of polynomial time operations equals standard class P.•Basic arithmetic operations faster than on Turing machines: addition and subtraction O(1), multiplication O(n). |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.tcs.2022.04.038 | Theoretical Computer Science |
Keywords | DocType | Volume |
Theory of computation,Model of computation,Automatic function,Register machine,Computational complexity | Journal | 924 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ziyuan Gao | 1 | 0 | 0.34 |
| Sanjay Jain | 2 | 1647 | 177.87 |
| Li Zeyong | 3 | 0 | 0.34 |
| Ammar Fathin Sabili | 4 | 0 | 0.34 |
| Frank Stephan | 5 | 215 | 39.36 |