BEGIN:VCALENDAR VERSION:2.0 PRODID:ILLC Website X-WR-TIMEZONE:Europe/Amsterdam BEGIN:VTIMEZONE TZID:Europe/Amsterdam X-LIC-LOCATION:Europe/Amsterdam BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19700329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:19701025T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:/NewsandEvents/Archives/2011/newsitem/3496/31- Jan-4-February-2011-Computability-and-Complexity-i n-Analysis-CCA-2011-Cape-Town-South-Africa DTSTAMP:20100808T000000 SUMMARY:Computability and Complexity in Analysis ( CCA 2011), Cape Town, South Africa DTSTART;VALUE=DATE:20110131 DTEND;VALUE=DATE:20110204 LOCATION:Cape Town, South Africa DESCRIPTION:The conference is concerned with the t heory of computability and complexity over real-va lued data. Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computabil ity theory is the study of the limitations and abi lities of computers in principle. Computational co mplexity theory provides a framework for understan ding the cost of solving computational problems, a s measured by the requirement for resources such a s time and space. The classical approach in these areas is to consider algorithms as operating on fi nite strings of symbols from a finite alphabet. Su ch strings may represent various discrete objects such as integers or algebraic expressions, but can not represent general real or complex numbers, unl ess they are rounded. Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability the ory and a complexity theory over the real numbers and over more general continuous data structures i s needed. Despite remarkable progress in recent ye ars many important fundamental problems have not y et been studied, and presumably numerous unexpecte d and surprising results are waiting to be discove red. For more information, see http://cca-net.de /cca2011/. CCA-2011 is co-located with CCR-2011. The Programme Committee cordially invites all re searchers to submit their papers for presentation. Submission deadline: October 1, 2010 (Abstracts o nly!). X-ALT-DESC;FMTTYPE=text/html:
\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 \n

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

\n
\n

\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
URL:/NewsandEvents/Archives/2011/newsitem/3496/31- Jan-4-February-2011-Computability-and-Complexity-i n-Analysis-CCA-2011-Cape-Town-South-Africa END:VEVENT END:VCALENDAR