Price loading...

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

Computer Science

Price data last checked 129 day(s) ago - refreshing...

View at Amazon

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

This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question? How can we show that none is possible? How computationally hard is the question we are concerned with? Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps? Can we perform some algorithm with only a limited memory? Does randomness help? Are there standard approaches to overcoming computational difficulty?

Product Specifications

Format: paperback
ASIN: 3031537432
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 11 May 2024
Listed Since: 06 January 2024

Barcode

No barcode data available

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

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Complexity and Real Computation

The Foundations of Computability Theory

Computability

Computational Complexity: A Conceptual Perspective

Computability and Complexity

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

Computability Theory: An Introduction to Recursion Theory

Automata and Computability (Undergraduate Texts in Computer Science)

Theory of Computation (Texts in Computer Science)

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)

Computational Complexity: A Modern Approach

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

A Programming Approach to Computability (Monographs in Computer Science)

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

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

Theory of Computation

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

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

The Incomputable: Journeys Beyond the Turing Barrier (Theory and Applications of Computability)

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)

Demystifying Computation: A Hands-on Introduction

Automata and Computability

Computability: An Introduction to Recursive Function Theory