Fondamenti dell'Informatica: Linguaggi Formali e Calcolabilita

[1]  Neil D. Jones,et al.  New problems complete for nondeterministic log space , 1976, Mathematical systems theory.

[2]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[3]  Mika Hirvensalo,et al.  Introduction to Evolutionary Computing , 2002, Natural Computing Series.

[4]  Neil D. Jones,et al.  Computability and complexity , 1997 .

[5]  John C. Mitchell,et al.  Foundations for programming languages , 1996, Foundation of computing series.

[6]  Chris Hankin.  Lambda Calculi: A Guide for Computer Scientists , 1995 .

[7]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[8]  Michael Sipser,et al.  The history and status of the P versus NP question , 1992, STOC '92.

[9]  P. Odifreddi.  Classical recursion theory , 1989 .

[10]  Kenneth Kunen,et al.  Set Theory: An Introduction to Independence Proofs , 2010 .

[11]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Joseph R. Shoenfield.  The axioms of set theory , 1977 .

[15]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[16]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[17]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[18]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[19]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.