\n

\nThe conference is concerned with the theory of comput ability and complexity over real-valued data.\n

\n\nComputability and complexity theory are tw o central areas of research in mathematical logic and theoretical computer science. Computability th eory is the study of the limitations and abilities of computers in principle. Computational complexi ty theory provides a framework for understanding t he cost of solving computational problems, as meas ured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite s trings of symbols from a finite alphabet. Such str ings may represent various discrete objects such a s integers or algebraic expressions, but cannot re present general real or complex numbers, unless th ey are rounded.\n

\n\nMost mathematical mode ls in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbe rs and over more general continuous data structure s is needed. Despite remarkable progress in recent years many important fundamental problems have no t yet been studied, and presumably numerous unexpe cted and surprising results are waiting to be disc overed.\n

\n \n \nFor mo re information, see\n http://cca-net.de/ cca2011/.\n CCA-2011 is co-located wit h CCR-2011.\n

\n\n

URL:/NewsandEvents/Events/Conferences/newsitem/349
6/31-Jan-4-February-2011-Computability-and-Complex
ity-in-Analysis-CCA-2011-Cape-Town-South-Africa
END:VEVENT
END:VCALENDAR
\n The Programme Committee cordially invit es all researchers\n to submit their papers for presentation.\n Submission deadline: O ctober 1, 2010 (Abstracts only!).\n

\n