Name: Handbook of Computability and Complexity in Analysis (en Inglés)
SKU: 57375847
Price: 72.97 USD
Availability: InStock
Author: Brattka, Vasco ; Hertling, Peter

portada Handbook of Computability and Complexity in Analysis (en Inglés)

Handbook of Computability and Complexity in Analysis (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Brattka, Vasco ; Hertling, Peter

Idioma

Inglés

N° páginas

427

Encuadernación

Tapa Blanda

ISBN13

9783030592363

Categorías

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

Handbook of Computability and Complexity in Analysis (en Inglés)

Brattka, Vasco ; Hertling, Peter (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 20 a 27 días háb.

$ 145.95$ 72.97

-50%

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

Libro Nuevo

Quedan más de 100 unidades

$ 72.97

Llega entre el 17 Sep y el 30 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Handbook of Computability and Complexity in Analysis (en Inglés)"

Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means?Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.