Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
Regulärer Preis:
inkl. MwSt.
78,15 €
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
Kategorien:
Beschreibung
A clear, comprehensive, and rigorous introduction to the theory of computation.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
- Extensive exercises and diagrams enhance streamlined, student-friendly presentation of mathematically rigorous material
- Includes thorough treatment of automata theory, computability theory, and complexity theory—including the P versus NP question and the theory of NP-completeness
- Suitable for undergraduate and graduate students, researchers, and professionals
A clear, comprehensive, and rigorous introduction to the theory of computation.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
- Extensive exercises and diagrams enhance streamlined, student-friendly presentation of mathematically rigorous material
- Includes thorough treatment of automata theory, computability theory, and complexity theory—including the P versus NP question and the theory of NP-completeness
- Suitable for undergraduate and graduate students, researchers, and professionals
Details
| Erscheinungsjahr: | 2023 |
|---|---|
| Inhalt: | Einband - fest (Hardcover) |
| ISBN-13: | 9780262048620 |
| ISBN-10: | 0262048620 |
| Sprache: | Englisch |
| Autor: | Hubie Chen |
| Hersteller: | MIT Press |
| Verantwortliche Person für die EU: | preigu GmbH & Co. KG, Lengericher Landstr. 19, D-49078 Osnabrück, mail@preigu.de |
| Maße: | 230 x 180 x 20 mm |
| Von/Mit: | Hubie Chen |
| Erscheinungsdatum: | 29.08.2023 |
| Gewicht: | 0,814 kg |
Ähnliche Produkte
Taschenbuch
Tipp
Lieferzeit 4-7 Werktage