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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Goodwill Books, Hillsboro, OR, USA
Zustand: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Bestandsnummer des Verkäufers 3IIT2J0011V9_ns
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Bestandsnummer des Verkäufers G0387949070I3N00
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Bestandsnummer des Verkäufers G0387949070I4N00
Anbieter: Pella Books, Pella, IA, USA
Hardcover. Zustand: Used Good. No Jacket. Bestandsnummer des Verkäufers 237958
Anbieter: Book Dispensary, Concord, ON, Kanada
Hardcover. Zustand: Good. GOOD hardcover, 15 pages have some underlining / other marks, rest of text clean. Book. Bestandsnummer des Verkäufers 147234
Anzahl: 1 verfügbar
Anbieter: Toscana Books, AUSTIN, TX, USA
Hardcover. Zustand: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Bestandsnummer des Verkäufers Scanned0387949070
Anbieter: BennettBooksLtd, San Diego, NV, USA
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-0387949070
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 671842-n
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Feb2215580174278
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 9780387949079