Computability and Logic
By:"George S. Boolos","John P. Burgess","Richard C. Jeffrey"
Published on 2007-09-17 by Cambridge University Press
This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem.
This Book was ranked 21 by Google Books for keyword Art of Computer Programming Volume Fundamental Algorithms by Donald Ervin Knuth.
0 Response to "Computability and Logic"
Post a Comment