![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Koscielski A. Pacholski L.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.191, Iss.1, 1998-01, pp. : 145-156
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Decidability results for primitive recursive algorithms
By David R.
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the asymptotic behaviour of primitive recursive algorithms
By David R.
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On primitive recursive algorithms and the greatest common divisor function
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)