Theory and Applications of Models of Computation

The International Conference on Theory and Applications of Models of Computation (TAMC) bridges the theoretical study of computational models with their practical applications in algorithm design and complexity analysis. TAMC covers automata theory, formal language theory, complexity theory, computability, and the application of computational models to problems in algorithms, logic, and the foundations of computer science. The conference fosters dialogue between theoreticians interested in the mathematical foundations of computation and researchers who apply formal models to practical computing challenges, including problems in verification, biology, and quantum computing.

complexity algorithms information theory computability

We invite submissions on computational complexity, automata and formal languages, computability theory, descriptive complexity, models of parallel and distributed computation, quantum computational models, algorithmic game theory, computational biology, and the application of theoretical models to practical problems in verification and algorithm design. Papers presenting significant theoretical advances or novel applications of computational models are welcome.