Call Number (LC) Title Results
QA9.615 .F67 1965 Formal systems and recursive functions 1
QA9.615 .G65 2003 Pyramid algorithms : a dynamic programming approach to curves and surfaces for geometric modeling / 1
QA9.615 .G65 2003eb Pyramid algorithms a dynamic programming approach to curves and surfaces for geometric modeling / 1
QA9.615 .K54 1969eb Formalized recursive functionals and formalized realizability / 1
QA9.615 .L64 1979 Recursion Theory, its Generalisations and Applications / 1
QA9.615 .L67 1994 Recursive algorithms / 1
QA9.615 .L67 1994eb Recursive algorithms / 1
QA9.615 .M67 1974 Elementary induction on abstract structures 1
QA9.615 .M8713 1999 Recursive functions and metamathematics : problems of completeness and decidability, Gödel's theorems / 1
QA9.615 .R64 1987 Theory of recursive functions and effective computability / 1
QA9.615 .R67 1984 Subrecursion : functions and hierarchies / 1
QA9.615 .S26 1992 Recursive functionals / 1
QA9.615 .S26 1992eb Recursive functionals 1
QA9.615 .S63 1987 Recursively enumerable sets and degrees : a study of computable functions and computably generated sets / 1
QA9.62 .H56 Recursion-theoretic hierarchies / 1
QA9.62 .H56 2016 Recursion-theoretic hierarchies / 1
QA9.62 .M38 1994 Combinatorial number-theory : a treatise on growth, based on the Goodstein-Skolem hierarchy, including a critique on non-constructive or first-order logic / 1
QA9.63 The incomputable : journeys beyond the Turing barrier / 1
QA9.63 .D69 2020 A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / 1
QA9.63 .D69 2021 A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / 1