Search Local DataBase.
Search CiNii Books.
Search CiNii Research(Articles).
Search CiNii Dissertations.
Search PubMed.
Search IRDB.
Search keyword:(Subject: #Computable functions)
Results:14items
Computable functions / A. Shen, N.K. Vereshchagin ; translated by V.N. Dubrovskii
Providence, R.I : American Mathematical Society , c2003. - (Student mathematical library ; v. 19)
Books
Computability, an introduction to recursive function theory / Nigel Cutland.
Cambridge, England : Cambridge University Press , 1980
Computable set theory / Domenico Cantone, Alfredo Ferro, and Eugenio Omodeo.
6. - Oxford, England : Clarendon Press , 1989-. - New York : Oxford University Press , 1989-. - (The International series of monographs on computer science ; 6)
Theory of recursive functions and effective computability / Hartley Rogers, Jr.
New York : McGraw-Hill , c1967. - (McGraw-Hill series in higher mathematics)
Recursion on the countable functionals / Dag Normann.
811. - Berlin : Springer , 1980. - (Lecture notes in mathematics ; 811)
A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability / Rod Downey, Noam Greenberg
: pbk,: [hardback]. - Princeton : Princeton University Press , 2020. - (Annals of mathematics studies ; no. 206)
Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon
Providence, RI : American Mathematical Society , c2020. - (Memoirs of the American Mathematical Society ; no. 1284)
Computation and automata / Arto Salomaa
Cambridge [Cambridgeshire] : Cambridge University Press , 1985. - (Encyclopedia of mathematics and its applications / edited by G.-C. Rota ; v. 25)
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore
Providence, Rhode Island : American Mathematical Society , 2017. - (Memoirs of the American Mathematical Society ; no. 1187)
Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit; Einfuhrung in die Theorie der rekursiven Funktionen
Bd. 109. - Berlin : Springer , 1961. - (Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berucksichtigung der Anwendungsgegiete ; Bd. 109)
Enumerability, decidability, computability; an introduction to the theory of recursive functions / by Hans Hermes. Translated by G.T Herman and O. Plassmann.
Bd.127. - Berlin : Springer , 1965. - (Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berucksichtigung der Anwendungsgegiete ; Bd.127)
Bd. 87. - 2. Aufl.. - Berlin : Springer , 1971. - (Heidelberger Taschenbucher ; Bd. 87)
Subrecursion : functions and hierarchies / H.E. Rose
: U.S.. - Oxford [Oxfordshire] : Clarendon Press. - New York : Oxford University Press , 1984. - (Oxford logic guides ; 9)
Non-classical logics, model theory, and computability : proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976 / edited by A. I. Arruda, N. C. A. da Costa, R. Chuaqui.
v. 89. - Amsterdam : North-Holland , 1977. - New York : sale distributors for the U.S.A. and Canada, Elsevier/North-Holland , 1977. - (Studies in logic and the foundations of mathematics ; v. 89)