TAMC aims at bringing together a wide range of researchers with \;interests in computational theory and applications. The main themes of \;the conference are computability\, complexity\, and algorithms. Typical but not exclusive topics of interest include:
* algebraic computation
* algorithmic coding theory
* algorithmic number theory
* approximation algorithms
* automata theory
* circuit complexity
* computability
* computational biology\, and biological computing
* computational complexity
* computational game theory
* computational logic
* computational geometry
* continuous and real computation
* cryptography
* data structures
* design and analysis of algorithms
* distributed algorithms
* fixed parameter tractability
* graph algorithms
* information and communication complexity
* learning theory
* natural computation
* network algorithms\, networks in nature and society
* online algorithms
* optimization
* parallel algorithms
* privacy and security
* property testing
* proof complexity
* quantum computing
* randomness\, pseudo-randomness
* randomized algorithms
* streaming algorithms