In this research monograph, the author constructs deterministic extractors for several types of sources, using a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length.
This book explains synchronization and the implementation of concurrent objects, presenting synchronization algorithms while also introducing the theory that underlies the implementation of concurrent objects in the presence of asynchrony and process crashes.
Combining lucid description and illustrations with rigorous arguments and detailed proofs, this book examines the core concepts of automata and languages, computability, and complexity of computation, and offers a solid foundation in computation theory.
Many Computation Engineering textbooks emphasize automata theory only, not logic, losing a the opportunity to tie these subjects together and reinforce learning. This textbook ties theory and logic together, using interactive tools, such as simple BDD and SAT tools. By providing a blend of theory and practical applications the material is presented as both inviting and current. Key concepts are illustrated in multiple domains so that information is reinforced and students can begin to tie theory and logic together.
Computational models can be found everywhere in present day science and engineering. In providing a logical framework and foundation for the specification and design of specification languages, the author uses this framework to study computable models.
This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.
Cartesian Genetic Programming (CGP) is a highly effective and increasingly popular form of genetic programming. This book contains chapters written by the leading figures in the development and application of CGP.