On primitive recursive algorithms and the greatest common divisor function

DOI10.1016/S0304-3975(02)00487-5zbMath1022.68129MaRDI QIDQ1399976

Yiannis N. Moschovakis

Publication date: 30 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

greatest common divisorrelative primitive recursion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

The laws of integer divisibility, and solution sets of linear divisibility conditions ⋮ A complete characterization of primitive recursive intensional behaviours ⋮ Is the Euclidean Algorithm Optimal Among its Peers? ⋮ The efficiency of primitive recursive functions: a programmer's view

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intensional aspects of function definitions
• About primitive recursive algorithms
• Generating the greatest common divisor, and limitations of primitive recursive algorithms
• A note on definition by cases
• On the asymptotic behaviour of primitive recursive algorithms

This page was built for publication: On primitive recursive algorithms and the greatest common divisor function