The Best Machine Theory Books 2025

1. The Connection Machine, Used [Paperback]

The Connection Machine describes a fundamentally different kind of computer. It offers a preview of a parallel processing computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time. W. Daniel Hillis is a founder of Thinking Machines Corporation where he is engaged in building connection machines as a significant step toward real thinking machines. The Connection Machineis included in the Artificial Intelligence series, edited by Patrick Winston, Michael Brady, and Daniel Bobrow.

The Connection Machine, Used [Paperback]

2. Handbook of Elliptic and Hyperelliptic Curve Cryptography, Used [Hardcover]

The discrete logarithm problem based on elliptic and hyperelliptic curves has gained a lot of popularity as a cryptographic primitive. The main reason is that no subexponential algorithm for computing discrete logarithms on small genus curves is currently available, except in very special cases. Therefore curve-based cryptosystems require much smaller key sizes than RSA to attain the same security level. This makes them particularly attractive for implementations on memory-restricted devices like smart cards and in high-security applications. The Handbook of Elliptic and Hyperelliptic Curve Cryptography introduces the theory and algorithms involved in curve-based cryptography. After a very detailed exposition of the mathematical background, it provides ready-to-implement algorithms for the group operations and computation of pairings. It explores methods for point counting and constructing curves with the complex multiplication method and provides the algorithms in an explicit manner. It also surveys generic methods to compute discrete logarithms and details index calculus methods for hyperelliptic curves. For some special curves the discrete logarithm problem can be transferred to an easier one; the consequences are explained and suggestions for good choices are given. The authors present applications to protocols for discrete-logarithm-based systems (including bilinear structures) and explain the use of elliptic and hyperelliptic curves in factorization and primality proving. Two chapters explore their design and efficient implementations in smart cards. Practical and theoretical aspects of side-channel attacks and countermeasures and a chapter devoted to (pseudo-)random number generation round off the exposition. The broad coverage of all- important areas makes this book a complete handbook of elliptic and hyperelliptic curve cryptography and an invaluable reference to anyone interested in this exciting field.

Handbook of Elliptic and Hyperelliptic Curve Cryptography, Used [Hardcover]

3. Switching and Finite Automata Theory (McGraw-Hill Computer Science Series) [Hardcover - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. Understand the structure, behavior, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.

Switching and Finite Automata Theory (McGraw-Hill Computer Science Series), Used [Hardcover]

4. Elements of the Theory of Computation [Hardcover - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. A general, yet comprehensive, introduction to the classical and contemporary theory of computation.

Elements of the Theory of Computation, Used [Hardcover]

5. Introduction to the Theory of Finite-State Machines [Hardcover - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. Introduction to the Theory of Finite-State Machines by Arthur Gill

Introduction to the Theory of Finite-State Machines, Used [Hardcover]

6. Automata and Computability [Hardcover - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and G del's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.

Automata and Computability, Used [Hardcover]

7. Computability and Complexity Theory, Used [Hardcover]

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory or complexity theory.

Computability and Complexity Theory, Used [Hardcover]

8. The Golden Ticket: P, Np, and the Search for the Impossible [Hardcover - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. Lance Fortnow traces the history and development of P-NP, giving examples from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

The Golden Ticket : P, NP, and the Search for the Impossible, Used [Hardcover]

9. Error patterns in computation: A semi-programmed approach [Paperback - Used]

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. As your students learn about mathematical operations and methods of computation, they may adopt erroneous procedures and misconceptions, despite your best efforts. This engaging book was written to model how you, the teacher, can make thoughtful analyses of your student's work, and in doing so, discover patterns in the errors they make. The text considers reasons why students may have learned erroneous procedures and presents strategies for helping those students. You will come away from the reading with a clear vision of how you can use student error patterns to gain more specific knowledge of their strengths on which to base your future instruction. Book jacket.

Error Patterns in Computation, Used [Paperback]

10. Beginning Math and Physics for Game Programmers

Whether one is a hobbyist or a budding game design pro, the objective is probably the same: to create the coolest games possible using today's increasingly sophisticated technology. Through clear, step-by-step instructions, author Wendy Stahler covers the trigonometry snippets, vector operations, and 1D/2D/3D motion designers need to improve their level of game development.

Whether one is a hobbyist or a budding game design pro, the objective is probably the same: to create the coolest games possible using today's increasingly sophisticated technology. Through clear, step-by-step instructions, author Wendy Stahler covers the trigonometry snippets, vector operations, and 1D/2D/3D motion designers need to improve their level of game development.