Compu tability and complexity theory are two central are as of\n research in mathematical logic and th eoretical computer\n science. Computability t heory is the study of the limitations\n and a bilities of computers in principle. Computational\ n complexity theory provides a framework for understanding the\n cost of solving computati onal problems, as measured by the\n requireme nt for resources such as time and space.
\nThe classical approach in these areas is to c onsider\n algorithms as operating on finite s trings of symbols from a\n finite alphabet. M ost mathematical models in physics and\n engi neering, however, are based on the real number\n concept. Thus, a computability theory and a co mplexity theory\n over the real numbers and o ver more general continuous data\n structures is needed. Despite remarkable progress in recent\ n years many important fundamental problems h ave not yet been\n studied, and presumably nu merous unexpected and surprising\n results ar e waiting to be detected. The conference provides a\n unique opportunity for people working in the area of computation\n on real-valued data but coming from different fields to meet,\n present work in progress and exchange ideas and kn owledge.
\n \n \nConference We b Page: http://cca-net.de/cca2012/\n < /p>\n
\n Authors o f contributed papers are invited to submit a PDF\n version of an extended abstract. Submissi on deadline: April\n 1, 2012\n
\n