The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies. This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.

This book is about quantum computing and quantum algorithms. The book starts with a chapter introducing the basic rules of quantum mechanics and how they can be used to build quantum circuits and perform computations. Further, Grover's algorithm is presented for unstructured search discussing its consequences and applications. Next, important techniques are discussed such as Quantum Fourier Transform and quantum phase estimation. Finally, Shor's algorithm for integer factorization is explained. At last, quantum walks are explained in detail covering both the discrete and continuous time models,and applications of this techniques are described for the design and analyses of quantum algorithms.

This volume contains the papers presented at the 30th Symposium on Mathematical Foundations of Computer Science (MFCS 2005) held in Gdansk, Poland from August 29th to September 2nd, 2005.

Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.

This book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, June/July 2006. The book presents 31 revised full papers together with 30 invited papers, including papers corresponding to 8 plenary talks and 6 special sessions on proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and Gödel centenary: Gödel's legacy for computability.

This book constitutes the proceedings of the 20th International Conference on Developments in Language Theory, DLT 2016, held in Montreal, QC, Canada, in July 2016. The 32 full papers and 4 abstracts of invited papers presented were carefully reviewed and selected from 48 submissions. This volume presents current developments in formal languages and automata, especially from the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimentional patterns; cryptography; concurrency; cellular automata; bio-inspried computing; quantum computing.

This book constitutes the refereed proceedings of the 5th International Conference on Machines, Computations, and Universality, MCU 2007, held in Orleans, France, September 2007. The 18 revised full papers presented together with nine invited papers cover Turing machines, register machines, word processing, cellular automata, tiling of the plane, neural networks, molecular computations, BSS machines, infinite cellular automata, real machines, and quantum computing.