<P>This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model''s rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and G¿del''s incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.</P>
Pris: kr 839.00 fra Norli
Butikk | Pris | |
---|---|---|
kr 839.00 | Besøk butikk |
This is an excellent, no-nonsense introduction to the field of coaching for developing practitioners. Using a rich array of examples from both life and business coaching, the book covers:</p><p></p><p>ofoundations of coaching</p><p>o...
kr 479.00
Mer informasjon
Computability theory originated with the seminal work of G¿del, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets...
kr 1279.00
Mer informasjon