In this book partial implementations of Von Neumann's Universal Constructor and universal copier are provided. Combining different technologies, we arrive at a proposal for a self-replicating Turing machine.

The book is geared toward those who thirst for computation theory knowledge. To cater to the demands of a wide range of people, the principles in this book are explained in a way that is easy to understand, digest and apply in the upcoming career.

It covers the traditional topics of formal languages, automata and complexity classes, as well as an introduction to the more modern topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity.

This textbook presents Automata Theory from a fresh viewpoint inspired by its main modern application, program verification, where automata are viewed as data structures for the algorithmic manipulation of sets and relations.

It includes topics from discrete mathematics, automata theory, formal language theory, and the theory of computation, along with practical applications to computer science. The course has no prerequisites other than introductory computer programming.

This book is an introduction to computer science. It will teach you to program, and do so in ways that are of practical value and importance. It uses a data-centric approach: data centric = data science + data structures.

This book is for students who want to learn quantum computing beyond a conceptual level, but who lack advanced training in mathematics. The only prerequisite is trigonometry, and mathematics beyond that will be covered.

This book provides a broad, conceptual overview of computational complexity theory - the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory, etc.

This book focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the fundamental limits of what can and cannot be computed mechanically.

Soft Computing is used where a complex problem is not adequately specified for the use of conventional math and computer techniques. This book elaborates on the most recent applications of Soft Computing in various fields of engineering.

Provides an introduction to the Quantum Computing, including the unique characteristics and constraints of the technology, and assesses the feasibility and implications of creating a functional quantum computer capable of addressing real-world problems.

This is a textbook on formal languages, automata theory, and computational complexity. This text strikes a good balance between rigor and an intuitive approach to computer theory.

The book introduces the reader to computer programming, i.e. algorithms and data structures. It covers many new programming concepts that have emerged in recent years including object-oriented programming and design patterns.

This book provides algorithms and ideas for computationalists, whether a working programmer or anyone interested in methods of computation. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms.

This book explores some of the more important terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages.

Computability Theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. These texts provide concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.

This work covers the advanced topics in main ideas of computing in general. Material is especially useful for the instructor, postgraduate and graduate students of IT-specialties and is suitable for the system of training of specialists.

This book gives an introduction to Soft Computing, which aims to exploit tolerance for imprecision, uncertainty, approximate reasoning, and partial truth in order to achieve close resemblance with human like decision making.

This book provides an overview of state of the art research in Affective Computing. It presents new ideas, original results and practical experiences in this increasingly important research field.

This book compiles refereed contributions to various aspects of Natural Computing, ranging from computing with slime mold, artificial chemistry, eco-physics, and synthetic biology, to computational aesthetics.

This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience.

This book presents algorithmic tools for algebraic geometry and experimental applications of them using Macaulay 2.

This highly accessible introduction to Lisp is suitable both for novices approaching their first programming language and experienced programmers interested in exploring a key tool for artificial intelligence research.

This book gives a consolidated overview of the research results achieved in the theory of automata and logic, covers many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, etc.

This is a short but excellent introduction to modal, temporal, and dynamic logic, etc. It manages to cover, in highly readable style, the basic completeness, decidability, and expressability results in a variety of logics of the three kinds considered.

This book introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. It is useful for the formalization of proofs and basics of automatic theorem proving.