Kostas Arkoudas

Learn More
Primitive recursion is a well known syntactic restriction on recursive deenitions which guarantees termination. Unfortunately many natural deenitions, such as the most common deenition of Euclid's GCD algorithm, are not primitive recursive. Walther has recently given a proof system for verifying termination of a broader class of deenitions. Although(More)
Having, as it is generally agreed, failed to destroy the conputational conception of mind with the GG odelian attack he articulated in his The Emperor's New Mind, Penrose is now back, armed with a new GG odelian Case, expressed in Chapters 2 and 3 of his recently published Shadows of the Mind. At the core of this case is a diagonal argument designed to show(More)
  • 1