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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
GRATIS
In U.S.A.
Descrizione libro Soft Cover. Condizione: new. Codice articolo 9781461273097
Descrizione libro Condizione: New. Codice articolo ABLIING23Mar2716030028723
Descrizione libro Condizione: New. Codice articolo 19494116-n
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9781461273097_lsuk
Descrizione libro Condizione: New. Book is in NEW condition. Codice articolo 1461273099-2-1
Descrizione libro Condizione: New. New! This book is in the same immaculate condition as when it was published. Codice articolo 353-1461273099-new
Descrizione libro Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 420 pp. Englisch. Codice articolo 9781461273097
Descrizione libro Condizione: New. Codice articolo I-9781461273097
Descrizione libro Condizione: New. Codice articolo 19494116-n
Descrizione libro Paperback. Condizione: New. Special order direct from the distributor Softcover reprint of the original 1st ed. 1997. Codice articolo ING9781461273097