<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:tamc="http://netlab.csu.edu.cn/TAMC09">
<channel>
<title>TAMC 2009</title>
<language>en-us</language>
<link>http://netlab.csu.edu.cn/TAMC09</link>
<description>Official website for TAMC 2009</description>

<item>
<title>The fininalized Call For Paper is released</title>
<link>http://netlab.csu.edu.cn/TAMC09</link>
<description>
	<p>The fininalized Call For Paper is released on the website. All necessary elements, include program committe, inivited speaker, have been added to the poster. A PDF version is also aviable.</p>
</description>
<pubDate>Sep 5th, 2008</pubDate>
<author>Gang Chen</author>
</item>


<item>
<title>Travel, hotel and visa information has been added</title>
<link>http://netlab.csu.edu.cn/TAMC09</link>
<description>
	<p>Please visit the our website for detailed information.</p>
</description>
<pubDate>May 20th, 2008</pubDate>
<author>Gang Chen</author>
</item>

<item>
<title>TAMC2009 Call for Papers</title>
<link>http://netlab.csu.edu.cn/TAMC09</link>
<description>
	<p>The 6th Annual Conference on Theory and Applications of Models of Computation (TAMC'09) will be held in ChangSha, P.R. China, from May 18 to May 22, 2009. Five previous annual meetings were held in 2004-2008, with enthusiastic participation from researchers all around the world. Websites for two recent conference meetings can be found at here, and here.</p>
	<p>The three main themes of the conference TAMC'09 will continue to be Computability, Complexity, and Algorithms. It aims to bring together researchers with interests 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, parallel algorithms, natural computation, models of computation, automata and neural networks, continuous and real computation, computable mathematics, relative computability and degree structures, Turing denability, generalized and higher type computation, proofs and computation, physical computability, decidability and undecidability.</p>
	<p>Please visit the our website for more information.</p>
</description>
<pubDate>May 10th, 2008</pubDate>
<author>Jianer Chen</author>
</item>

</channel>
</rss>

