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 **leonardo78** at March 9, 2017

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

Posted by **interes** at Feb. 14, 2017

English | 2006-03-23 | ISBN: 1846282977 | 440 pages | PDF | 3.6 mb

Posted by **libr** at Feb. 6, 2017

English | 2014 | ISBN: 9325975599 | 303 pages | PDF | 6 MB

Posted by **interes** at Nov. 21, 2015

English | ISBN: 113318779X | 2012 | PDF | 480 pages | 10.2 MB

Posted by **tukotikko** at Feb. 23, 2015

1997 | 464 Pages | ISBN: 0201258285 | PDF | 24 MB

Posted by **ChrisRedfield** at Jan. 23, 2015

Published: 2012-04-17 | ISBN: 1118014782 | PDF | 416 pages | 15 MB

Posted by **Veslefrikk** at Dec. 19, 2014

Publisher: Jo.nes & Bart.lett Publis.hers 1996 | 628 Pages | ISBN: 0867204974 | DJVU | 3 MB

Posted by **Veslefrikk** at Dec. 19, 2014

Publisher: P.W.S Pub 1997 | 396 Pages | ISBN: 053494728X | DJVU | 4 MB

Posted by **groovebeat** at Sept. 12, 2014

WEB-Rip | .RM | RealMedia Video | 320x240 | RealMedia Audio | 25 Hours | 3.37 GB

A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course.