Chapman and Hall/CRC, 2012. — 277 p. Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently. The book enables readers to understand: What does...
Springer, 2024. — 360 p. — (Undergraduate Topics in Computer Science). — ISBN: 3031537432. 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 that seeks to clarify what we mean by computation...
Springer, 2024. — 360 p. — (Undergraduate Topics in Computer Science). — ISBN: 3031537432. 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 that seeks to clarify what we mean by computation...
The MIT Press, 2023. — 416 p. — ISBN-13: 978-0262048620. A clear, comprehensive, and rigorous introduction to the theory of computation. What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers...
Springer, 2023. — 530 p. This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof...
ACM Books, 2023. — 426 p. — ISBN: 979-8-4007-0778-0. Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and profound way." This volume...
New York: ACM Books, 2023. — 426 p. Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and profound way." This volume includes a...
McGill-Queen's University Press, 1986. — 203 p. This volume contains papers presented at the First International Workshop on Distributed Algorithms. The papers present solutions to a wide spectrum of problems (leader election, resource allocation, routing, etc.) and focus on a variety of issues that influence communications complexity. The bit complexity of probabilistic leader...
Springer Cham, 2023. — 252 p. — (Theory and Applications of Computability) — eBook ISBN: 978-3-031-34827-3. It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions. In this unique textbook/reference, programs are drawn as string diagrams in the language of...
Oxford University Press, 1997. — 683 p. Models of Computation and Formal Languages presents a comprehensive and rigorous treatment of the theory of computability. The text takes a novel approach focusing on computational models and is the first book of its kind to feature companion software. Deus Ex Machina, developed by Nicolae Savoiu, comprises software simulations of the...
MIT Press, 2023. — 103 p. — ISBN13: 9780262048620. — ISBN10: 0262048620. A clear, comprehensive, and rigorous introduction to the theory of computation. What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation....
Springer, 2021. — 221 p. — (Texts in Computer Science). — ISBN: 978-3-030-87882-5. This textbook aims to help the reader develop an in-depth understanding of logical reasoning and gain knowledge of the theory of computation. The book combines theoretical teaching and practical exercises; the latter is realized in Isabelle/HOL, a modern theorem prover, and PAT, an industry-scale...
Independently published, 2023. — 102 p. In the past decade, Artificial Intelligence has been making waves. From self-driving cars to Siri to Alexa, Artificial Intelligence (AI) is everywhere. But what exactly is it? The term "artificial intelligence" was coined in 1956 by John McCarthy, a computer scientist at Dartmouth College. His work was based on the idea that computers...
Th Edition. — World Scientific Publishing, 2023. — 497 p. — ISBN: 9789811260674. This unique compendium highlights the theory of computation, particularly logic and automata theory. Special emphasis is on Computer Science (CS) applications including loop invariants, program correctness, logic programming, and algorithmic proof techniques. This innovative volume differs from...
Oxford University Press, 1995. — 327 p. This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental...
American Mathematical Society, 2017. — 519 p. Basic notions and notation. Introduction. What is this book about? Plain Kolmogorov complexity. The complexity of pairs and conditional complexity. Martin-Löf randomness. A priori probability and prefix complexity. Monotone complexity. General scheme for complexities. Shannon entropy and Kolmogorov complexity. Some applications....
American Mathematical Society, 2017. — 519 p. Basic notions and notation. Introduction. What is this book about? Plain Kolmogorov complexity. The complexity of pairs and conditional complexity. Martin-Löf randomness. A priori probability and prefix complexity. Monotone complexity. General scheme for complexities. Shannon entropy and Kolmogorov complexity. Some applications....
New York: Academic Press/Elsevier, 2023. — 230 p. Algebraic Theory for True Concurrency presents the algebraic laws for true concurrency. Parallelism and concurrency are two of the core concepts within Computer Science. This book covers the different realms of coincidence, which enables programs, algorithms or problems to be broken out into order-independent or partially...