Independently published, 2019. — 363 p. — ISBN10: 1686863268; ISBN13: 978-1686863264 This book was written to fill the gap that exists when Computer Science students, and programmers, attempt to learn and analyze the different algorithms that currently exist. I took a course on Algorithms and was disappointed in the type of material that’s currently available. There are two...
Springer, 2011. — 195 p. — ISBN: 0857291203 9780857291202. Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of...
O’Reilly Media, Inc., 2021. — 282 p. — ISBN: 978-1-492-09106-6. 2021-07-20: First Release When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in...
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...
Palgrave Macmillan Cham, 2022. — 180 p. — ISBN: 978-3-031-04219-5. During the Iraq War, American soldiers were sent to both fight an enemy and to recover a “failed state” in pixelated camouflage uniforms, accompanied by robots, and armed with satellite maps and biometric hand-held scanners. The Iraq War, however, was no digital game: massive-scale physical death and destruction...
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...
Rodney Anderson, 2018. — 124 p. — ASIN B07DS7GXFG. An easy & simple guide to analyzing programs and algorithms using Big-O, Big Omega, & Big Theta, including cheat sheets and practice problems.
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...
Comments