Name: Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (en Inglés)
SKU: 57747203
Price: 67.30 USD
Availability: InStock
Author: Downey, Rod
ISBN: 9783031537431

portada Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (en Inglés)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (en Inglés)

Formato

Libro Físico

Autor

Rod Downey

Editorial

Springer

Idioma

Inglés

N° páginas

346

Encuadernación

Tapa Blanda

ISBN13

9783031537431

Categorías

Ciencia y análisis de datos: generalidades
Lógica matemática
Análisis y captura de datos
Ciencias de la computación

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (en Inglés)

Rod Downey (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 18 a 25 días háb.

$ 122.37$ 67.30

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 67.30

Llega entre el 16 Oct y el 29 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (en Inglés)"

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?