Kozen,Dexter C. <br/><br/>
Automata and Computability, Undergraduate Texts in Computer Science. 

 - New York:   Springer,  1997. 
 - xiii,400p. 
<br/><br/>Lecture 32<br/> Decidable and Undecidable ProblemsLecture 33 <br/>Reduction; Lecture<br/> 34 Rice's Theorem; Lecture <br/>35 Undecidable Problems About CFLs; Lecture<br/> 36 Other Formalisms; Lecture <br/>37 The λ-Calculus; Supplementary Lecture I While Programs; Supplementary Lecture J Beyond Undecidability; Lecture <br/>38 Godel's Incompleteness Theorem; Lecture<br/> 39 Proof of the Incompleteness Theorem; Supplementary Lecture K Godel's Proof; Exercises; Miscellaneous Exercises Finite Automata and Regular Sets; Miscellaneous Exercises Pushdown Automata and Context-Free Languages 
<br/><br/><label>ISBN: </label>9781461273097 
<br/><br/><label>Subjects--Topical Terms: </label>-- Computable functions --Fonctions calculables --Machine theory Théorie des automates
<br/><br/><label>Dewey Class. No.: </label>511.3  / KOZ/A