Artículos relacionados a Handbook of Computability and Complexity in Analysis...
Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability) - Tapa dura
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Vasco Brattka is a professor for Theoretical Computer Science and Mathematical Logic at the Universität der Bundeswehr München and an Honorary Research Associate at the University of Cape Town. He is the Editor-in-Chief of Computability, the journal of the association, Computability in Europe, published by IOS Press. His research interests include computable analysis, computability theory, effective descriptive set theory, algorithmic randomness, complexity and logic, and Weihrauch complexity.
Peter Hertling is a professor in the Institut für Theoretische Informatik, Mathematik und Operations Research at the Universität der Bundeswehr München. He is an Associate Editor of the Journal of Complexity, published by Elsevier. His research interests include computable analysis, descriptive complexity and algorithmic randomness, complexity theory over the real numbers, and information-based complexity.
De la contraportada
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 comprehensive handbook contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, as well as a wealth of information and references that will help them to navigate the modern research literature in this field.
Vasco Brattka is a professor for Theoretical Computer Science and Mathematical Logic at the Universität der Bundeswehr München. He is editor-in-chief of Computability, the journal of the association, Computability in Europe. Peter Hertling is a professor in the Institute for Theoretical Computer Science, Mathematics and Operations Research at UniBwM. He is an associate editor of Journal of Complexity.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 79,18
EUR 9,81 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Handbook of Computability and Complexity in Analysis...
Imagen de archivo
Handbook of Computability and Complexity in Analysis
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 427. Nº de ref. del artículo: 26390048562
Cantidad disponible: 1 disponibles
Imagen de archivo
Handbook of Computability and Complexity in Analysis
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 427. Nº de ref. del artículo: 390599917
Cantidad disponible: 1 disponibles
Imagen de archivo
Handbook of Computability and Complexity in Analysis
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 427. Nº de ref. del artículo: 18390048568
Cantidad disponible: 1 disponibles
Imagen de archivo
Handbook of Computability & Complexity in Analysis
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-13564
Cantidad disponible: 1 disponibles
Imagen del vendedor
Handbook of Computability and Complexity in Analysis
Publicado por
Springer International Publishing, 2021
ISBN 10: 3030592332
ISBN 13: 9783030592332
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer scienceResearchers and graduate students will appreciate the book s systematic introductions into many branches of computab. Nº de ref. del artículo: 458549923
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Handbook of Computability and Complexity in Analysis
Publicado por
Springer International Publishing Jun 2021, 2021
ISBN 10: 3030592332
ISBN 13: 9783030592332
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This handbook is the first coherent presentation of a cross-section through most active research topics on the more theoretical side of the field. All chapters are written by leading experts who are 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 help them to navigate through the modern research literature in this field. 456 pp. Englisch. Nº de ref. del artículo: 9783030592332
Cantidad disponible: 2 disponibles
Imagen del vendedor
Handbook of Computability and Complexity in Analysis
Publicado por
Springer International Publishing, 2021
ISBN 10: 3030592332
ISBN 13: 9783030592332
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783030592332
Cantidad disponible: 1 disponibles
Imagen del vendedor
Handbook of Computability and Complexity in Analysis
Publicado por
Springer International Publishing, Springer International Publishing Jun 2021, 2021
ISBN 10: 3030592332
ISBN 13: 9783030592332
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 456 pp. Englisch. Nº de ref. del artículo: 9783030592332
Cantidad disponible: 2 disponibles
Imagen de archivo
Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
hardcover. Condición: New. New. book. Nº de ref. del artículo: ERICA80030305923326
Cantidad disponible: 1 disponibles