About primitive recursive algorithms
Selected papers of the 16th international colloquium on Automata, languages, and programming
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Sequential algorithms, deterministic parallelism, and intensional expressiveness
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Loop exits and structured programming: reopening the debate
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Computing minimum with primitive recursion over lists
Theoretical Computer Science
System T, call-by-value and the minimum problem
Theoretical Computer Science
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
On the asymptotic behaviour of primitive recursive algorithms
Theoretical Computer Science
Intensionality versus Extensionality and Primitive Recursion
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
On primitive recursive algorithms and the greatest common divisor function
Theoretical Computer Science
On the expressive power of the loop language
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in such a way that their complexity is preserved.