Cutland – An introduction to re- cursive function theory

Libro adottato a Camerino, a.a. 2025/2026 · 1 canale

«Cutland – An introduction to re- cursive function theory» è adottato per Computability And Complexity dal prof. Patrizio Cintioli (Matematica e Applicazioni - Mathematics and Applications – sede di Camerino – Camerino).

Come lo indica il docente: N.J. Cutland. Computability, An introduction to re- cursive function theory. Cambridge University Press, New York (1980). 2. P. Odifreddi. Classical recursion Theory. Studies in Logic and the Foundations of Mathematics 125, North Holland, Amsterdam, (1989). 3. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967). 4. M. Davis. Computability and Unsolvability. McGraw- Hill, New York (1958). 5. R. I. Soare. Recursively Enumerable Sets and De- grees, Perspectives in Mathematical Logic. Springer- Verlag Berlin Heidelberg, (1987). 6. R.I. Soare. Turing Computability, Springer-Verlag Berlin Heidelberg, (2016) COMPLEXITY 1. M. R. Garey, D. S. Johnson. Computers and Intrac- tability. A guide to the Theory of NP-Completeness. W. H. FREEMAN AND COMPANY, New York (1979). 2. J. L. Balc´ azar, J. D´ ıaz, J. Gabarr` o. Structural Com- plexity I. Springer-Verlag (1988). 3. J. E. Hopcroft, J. D. Ullman. Introduction to Auto- mata Theory, Languages and Computation. Addison- Wesley Publishing Company, Inc. (1979). 4. C. H. Papadimitriou. Computational Complexity. Pearson College Div. (1993). 5. S. Arora, B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, New

Chi lo adotta

• Computability And Complexity – Prof. Patrizio Cintioli (canale unico) a.a. 2025/2026Matematica e Applicazioni - Mathematics and Applications – sede di Camerino · Laurea magistrale (LM-40) · esame facoltativo · Pure Mathematics · 6 CFU

Programma e testi di ogni canale