The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07) will be held in Shanghai, China, May 22 to 25, 2007. Three previous annual meetings were held in 2004, 2005 and 2006, with enthusiastic participation from researchers all around the world.

The three main themes of the conference TAMC07 will continue to be Computability, Complexity, and Algorithms. It aims to bring together researchers with an interest in theoretical computer science, algorithmic mathematics, and applications to the physical sciences. Typical but not exclusive topics of interest include:

algorithms and data structures
computational complexity
cryptography
computational geometry
computational game theory
algorithmic graph theory and combinatorics
algorithmic algebra
number theory and coding theory
learning theory
computational biology
theoretical problems in networks and security
quantum computing
randomness
on-line algorithms
and parallel algorithms
natural computation
models of computation
automata and neural networks
continuous and real computation
computable mathematics
relative computability and degree structures
Turing definability
generalised and higher type computation
proofs and computation
physical computability
decidability and undecidability