On primitive recursive algorithms and the greatest common divisor function

Author： Moschovakis Y.N.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.301, Iss.1, 2003-05, pp. : 1-30

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Decidability results for primitive recursive algorithms

By David R.  

Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. : 477-504

Elsevier

Access to resources Recommend Favorite

On the asymptotic behaviour of primitive recursive algorithms

By David R.  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 159-193

Elsevier

Access to resources Recommend Favorite

Barnett’s Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices

By Diaz-Toca G.M.   Gonzalez-Vega L.  

Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. : 59-81

Academic Press

Access to resources Recommend Favorite

Makanin's algorithm is not primitive recursive

By Koscielski A.   Pacholski L.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 145-156

Elsevier

Access to resources Recommend Favorite

Recursive Iterative Algorithms for Adaptive Identification of Nonlinear Concentrated Dynamic Systems

By Blumin S.L.   Krutova I.N.  

Automation and Remote Control, Vol. 64, Iss. 10, 2003-10 ,pp. : 1583-1588

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite