Posted by **arundhati** at June 23, 2019

English | ISBN: 0745679471 | 2019 | 192 pages | EPUB, PDF | 354 KB + 1134 KB

Posted by **Sangviniy** at March 23, 2017

English | Oct. 14, 1994 | ISBN: 0387943323 | 148 Pages | PDF | 2.26 MB

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms.

Posted by **AvaxGenius** at Dec. 26, 2019

English | PDF | 2019 | 761 Pages | ISBN : 1785616595 | 5.86 MB

The theory of computation is used to address challenges arising in many computer science areas such as artificial intelligence, language processors, compiler writing, information and coding systems, programming language design, computer architecture and more. To grasp topics concerning this theory readers need to familiarize themselves with its computational and language models, based on concepts of discrete mathematics including sets, relations, functions, graphs and logic.

Posted by **leonardo78** at March 9, 2017

2010 | ISBN: 0073191469 | 448 pages | PDF | 3,3 MB

Posted by **IrGens** at July 10, 2018

English | May 1, 2018 | ISBN: 0691170665 | PDF | 408 pages | 4.9 MB

Posted by **ksveta6** at Feb. 5, 2018

2017 | ISBN: 1771885289 | English | 402 pages | PDF | 29 MB

Posted by **AvaxGenius** at May 20, 2018

English | PDF(Repost),EPUB | 2011| 310 Pages | ISBN : 1461406811 | 5.09 MB

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable.

Posted by **hill0** at Nov. 28, 2019

by Mike James

English | 2019 | ASIN: B081YS81L7 | 214 Pages | PDF | 7.57 MB

Posted by **insetes** at Nov. 10, 2018

2012 | 504 Pages | ISBN: 1133187811 | PDF | 8 MB

Posted by **tarantoga** at May 14, 2019

ASIN: B07FW65QD5 | 2018 | MP3@64 kbps | ~14:11:00 | 422 MB