Price loading...

MIT Press Computability and Complexity

Name: Computability and Complexity
Brand: MIT Press

Black

AI & Machine Learning

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

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. 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

Key Features

Computability and Complexity

Product_Type: ABIS_BOOK

Brand: The MIT Press

Color: Black

Product Specifications

Brand: MIT Press
Colour: Black
Format: hardcover
ASIN: 0262048620
Category: Books > Subjects > Computing & Internet > Computer Science > AI & Machine Learning
Domain: Amazon UK
Release Date: 29 August 2023
Listed Since: 13 December 2022

Barcode

No barcode data available

MIT Press Computability and Complexity

Price History & Forecast

No Price Data Available

Price Distribution

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Computability Theory: An Introduction to Recursion Theory

What Can Be Computed? – A Practical Guide to the Theory of Computation

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

The Foundations of Computability Theory

Computational Complexity: A Conceptual Perspective

Complexity and Real Computation

Computability

Automata and Computability (Undergraduate Texts in Computer Science)

Computational Complexity: A Modern Approach

Theory of Computation

Computability: An Introduction to Recursive Function Theory

Automata and Computability

The Nature of Computation

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Theory of Computation (Texts in Computer Science)

Demystifying Computation: A Hands-on Introduction

Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)

A Programming Approach to Computability (Monographs in Computer Science)