The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC
2012) will be held in Institute of Software, Chinese Academy of Sciences, Beijing, China, May 16 to 21, 2012, as a Turing Centenary Meeting.

The Turing Lectures 2012
S. Barry Cooper ( Leeds )
John Hopcroft( Cornell)
Richard Karp (Berkeley)
Jon Kleinberg (Cornell)
Butler Lampson (Microsoft)
Wei Li (BUAA)
Andrew Chi-Chih Yao (Tsinghua, Beijing)

TAMC 2012 Invited Special Sessions

1. Algorithms and Information in Networks (Organising Chairs: Zhiyong Liu )
Invited speakers:
2. Complexity and Cryptography (Organising Chair: Xiaotie Deng)
Invited speakers:
Xi Chen
3. Models of Computing and Networking (Organising Chairs: Anthony Bonato )
Invited speakers:
Anthony Bonato
4. Programming and Verification (Organising Chair: Wenhui Zhang)
Invited speakers:
Naijun Zhan

Aims and Scope:

TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference TAMC 2012 will be Computability, Complexity, and Algorithms with extensions to information and networks. Typical but not exclusive topics of interest include:

Algorithmic algebra
Algorithmic graph theory and combinatorics
Algorithms and data structures
Approximation algorithms
Automata and neural networks
Computational biology, and bio-informatics
Computational complexity
Computational game theory, network game theory
Computational geometry
Computable mathematics
Continuous and real computation
Cryptography and complexity
Decidability and undecidability
Derandomization
Error correcting code and locally testable codes
Generalized and higher type computation
Internet mathematics
Learning theory, and intelligent computing
Local test of mathematical properties
Models of computing and networking
Natural computation
Network algorithms
Networking
Networks in nature and society - new laws and principles
Number theory and coding theory
On-line algorithms and parallel algorithms
Physical computability
Programm checking
Programming and verification
Proofs and computation
Quantum computing
Randomized algorithms
Randomness in complexity classes and in nature
Relative computability and degree structures
Robustness and security of networks
Theory of networks and emergence
Turing definability
More information about the conference is available on the TAMC 12 web site.