This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Gratuit expédition vers Etats-Unis
Destinations, frais et délaisEUR 3,72 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Zoom Books East, Glendale Heights, IL, Etats-Unis
Etat : good. Book is in good condition and may include underlining highlighting and minimal wear. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. N° de réf. du vendeur ZEV.0387949070.G
Quantité disponible : 1 disponible(s)
Vendeur : Goodwill Books, Hillsboro, OR, Etats-Unis
Etat : acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. N° de réf. du vendeur 3IIT2J0011V9_ns
Quantité disponible : 1 disponible(s)
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Hardback. Etat : Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. N° de réf. du vendeur GOR003375305
Quantité disponible : 1 disponible(s)
Vendeur : Pella Books, Pella, IA, Etats-Unis
Hardcover. Etat : Used Good. No Jacket. N° de réf. du vendeur 237958
Quantité disponible : 1 disponible(s)
Vendeur : Book Dispensary, Concord, ON, Canada
Hardcover. Etat : Good. GOOD hardcover, 15 pages have some underlining / other marks, rest of text clean. Book. N° de réf. du vendeur 147234
Quantité disponible : 1 disponible(s)
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In poor condition, suitable as a reading copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9780387949079. N° de réf. du vendeur 9048632
Quantité disponible : 1 disponible(s)
Vendeur : Toscana Books, AUSTIN, TX, Etats-Unis
Hardcover. Etat : new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. N° de réf. du vendeur Scanned0387949070
Quantité disponible : 1 disponible(s)
Vendeur : BennettBooksLtd, San Diego, NV, Etats-Unis
hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0387949070
Quantité disponible : 1 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. 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 discussions of effective computability, decidability, and Godel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science. The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780387949079
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. 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 discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science. 420 pp. Englisch. N° de réf. du vendeur 9780387949079
Quantité disponible : 2 disponible(s)