04559nam a22005895i 4500 978-3-031-53744-8 DE-He213 20251030112034.0 cr nn 008mamaa 240510s2024 sz | s |||| 0|eng d 9783031537448 978-3-031-53744-8 10.1007/978-3-031-53744-8 doi QA75.5-76.95 UYA bicssc COM014000 bisacsh UYA thema Downey, Rod. author. aut http://id.loc.gov/vocabulary/relators/aut 76603 Computability and Complexity [electronic resource] : Foundations and Tools for Pursuing Scientific Applications / by Rod Downey. 1st ed. 2024. Cham : Springer Nature Switzerland : Imprint: Springer, 2024. XXVIII, 346 p. 17 illus. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Undergraduate Topics in Computer Science, 2197-1781 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. 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. Computer science. 58552 Computational complexity. Computable functions. 76604 Recursion theory. 76605 Application software. System theory. 66519 Theory of Computation. 67552 Computational Complexity. Computability and Recursion Theory. 76606 Computer and Information Systems Applications. Complex Systems. 66520 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783031537431 Printed edition: 9783031537455 Undergraduate Topics in Computer Science, 2197-1781 66494 https://doi.org/10.1007/978-3-031-53744-8 ZDB-2-SCS ZDB-2-SXCS 59752 59752