Zur Startseite gehen
0,00 €*
Cover: 9783031537431 | Computability and Complexity | Rod Downey | Taschenbuch | Paperback
Dekorationsartikel gehören nicht zum Leistungsumfang.
Computability and Complexity
Foundations and Tools for Pursuing Scientific Applications
Taschenbuch von Rod Downey
Sprache: Englisch

58,84 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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?
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?
Über den Autor

Rodney Downey is an Emeritus Professor at Victoria University of Wellington, NZ. He is the co-author of the Springer books, Fundamentals of Parameterized Complexity, and Algorithmic Randomness and Complexity. He has won many prizes for his work, including (twice) the Shoenfield Prize for writing, as well as the Rutherford Medal, New Zealand's premier science award.

Inhaltsverzeichnis

Introduction.- Some Naive Set Theory.- Regular Languages and Finite Automata.- General Models of Computation.- Deeper Computability.- Computational Complexity.- NP- and PSPACE-Completeness.- Some Structural Complexity.- Parameterized Complexity.- Average Case, Smoothed Analysis, and Generic Case.- Complexity.- References.

Details
Erscheinungsjahr: 2024
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Undergraduate Topics in Computer Science
Inhalt: xxviii
346 S.
17 s/w Illustr.
346 p. 17 illus.
ISBN-13: 9783031537431
ISBN-10: 3031537432
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Downey, Rod
Hersteller: Springer Nature Switzerland
Springer International Publishing
Springer International Publishing AG
Undergraduate Topics in Computer Science
Maße: 235 x 155 x 21 mm
Von/Mit: Rod Downey
Erscheinungsdatum: 11.05.2024
Gewicht: 0,569 kg
Artikel-ID: 128284679
Über den Autor

Rodney Downey is an Emeritus Professor at Victoria University of Wellington, NZ. He is the co-author of the Springer books, Fundamentals of Parameterized Complexity, and Algorithmic Randomness and Complexity. He has won many prizes for his work, including (twice) the Shoenfield Prize for writing, as well as the Rutherford Medal, New Zealand's premier science award.

Inhaltsverzeichnis

Introduction.- Some Naive Set Theory.- Regular Languages and Finite Automata.- General Models of Computation.- Deeper Computability.- Computational Complexity.- NP- and PSPACE-Completeness.- Some Structural Complexity.- Parameterized Complexity.- Average Case, Smoothed Analysis, and Generic Case.- Complexity.- References.

Details
Erscheinungsjahr: 2024
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Undergraduate Topics in Computer Science
Inhalt: xxviii
346 S.
17 s/w Illustr.
346 p. 17 illus.
ISBN-13: 9783031537431
ISBN-10: 3031537432
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Downey, Rod
Hersteller: Springer Nature Switzerland
Springer International Publishing
Springer International Publishing AG
Undergraduate Topics in Computer Science
Maße: 235 x 155 x 21 mm
Von/Mit: Rod Downey
Erscheinungsdatum: 11.05.2024
Gewicht: 0,569 kg
Artikel-ID: 128284679
Warnhinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...