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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: clickgoodwillbooks, Indianapolis, IN, Estados Unidos de America
Condición: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media. Nº de ref. del artículo: CSIV.0387949070.A
Cantidad disponible: 1 disponibles
Librería: Goodwill Books, Hillsboro, OR, Estados Unidos de America
Condición: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Nº de ref. del artículo: 3IIT2J0011V9_ns
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Hardcover. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G0387949070I3N00
Cantidad disponible: 1 disponibles
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Condición: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00094757936
Cantidad disponible: 2 disponibles
Librería: Toscana Books, AUSTIN, TX, Estados Unidos de America
Hardcover. Condición: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Nº de ref. del artículo: Scanned0387949070
Cantidad disponible: 1 disponibles
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
hardcover. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: Q-0387949070
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 671842-n
Cantidad disponible: 1 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Feb2215580174278
Cantidad disponible: 2 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: 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 ref. del artículo: 9780387949079
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: 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 ref. del artículo: 9780387949079
Cantidad disponible: 2 disponibles