Computability and Complexity (Record no. 87994)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04552nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-031-53744-8 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730172055.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240510s2024 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783031537448 |
| -- | 978-3-031-53744-8 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.0151 |
| 100 1# - AUTHOR NAME | |
| Author | Downey, Rod. |
| 245 10 - TITLE STATEMENT | |
| Title | Computability and Complexity |
| Sub Title | Foundations and Tools for Pursuing Scientific Applications / |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2024. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XXVIII, 346 p. 17 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Undergraduate Topics in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | The ideas and techniques comprised in the mathematical framework for understanding computation should form part of the standard background of a graduate in mathematics or computer science, as the issues of computability and complexity permeate modern science. This textbook/reference offers a straightforward and thorough grounding in the theory of computability and computational complexity. Among topics covered are basic naive set theory, regular languages and automata, models of computation, partial recursive functions, undecidability proofs, classical computability theory including the arithmetical hierarchy and the priority method, the basics of computational complexity and hierarchy theorems. Topics and features: · Explores Conway's undecidability proof of the ``3x+1'' problem using reductions from Register Machines and "Fractran" · Offers an accessible account of the undecidability of the exponential version of Hilbert's 10th problem due to Jones and Matijacevič · Provides basic material on computable structure, such as computable linear orderings · Addresses parameterized complexity theory, including applications to algorithmic lower bounds and kernelization lower bounds · Delivers a short account of generic-case complexity and of smoothed analysis · Includes bonus material on structural complexity theory and priority arguments in computability theory This comprehensive textbook will be ideal for advanced undergraduates or beginning graduates, preparing them well for more advanced studies or applications in science. Additionally, it could serve such needs for mathematicians or for scientists working in computational areas, such as biology. 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-031-53744-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer Nature Switzerland : |
| -- | Imprint: Springer, |
| -- | 2024. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computational complexity. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computable functions. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Recursion theory. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Application software. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | System theory. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computational Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computability and Recursion Theory. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer and Information Systems Applications. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Complex Systems. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 2197-1781 |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
No items available.