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/2012/newsitem/4216/24- 27-June-2012-Nineth-International-Conference-on-Co mputability-and-Complexity-in-Analysis-CCA-2012-Ca mbridge-U-K- DTSTAMP:20111130T000000 SUMMARY:Nineth International Conference on Computa bility and Complexity in Analysis (CCA 2012), Camb ridge, U.K. DTSTART;VALUE=DATE:20120624 DTEND;VALUE=DATE:20120627 LOCATION:Cambridge, U.K. DESCRIPTION:Computability and complexity theory ar e two central areas of research in mathematical lo gic and theoretical computer science. Computabilit y theory is the study of the limitations and abili ties of computers in principle. Computational comp lexity theory provides a framework for understandi ng the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these a reas is to consider algorithms as operating on fin ite strings of symbols from a finite alphabet. Mos t mathematical models in physics and engineering, however, are based on the real number concept. Thu s, a computability theory and a complexity theory over the real numbers and over more general contin uous data structures is needed. Despite remarkable progress in recent years many important fundament al problems have not yet been studied, and presuma bly numerous unexpected and surprising results are waiting to be detected. The conference provides a unique opportunity for people working in the area of computation on real-valued data but coming fro m different fields to meet, present work in progre ss and exchange ideas and knowledge. Conference W eb Page: http://cca-net.de/cca2012/ Authors of c ontributed papers are invited to submit a PDF vers ion of an extended abstract. Submission deadline: April 1, 2012 X-ALT-DESC;FMTTYPE=text/html:
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 Authors of cont ributed papers are invited to submit a PDF\n version of an extended abstract. Submission dea dline: April\n 1, 2012\n
\n < /div> URL:/NewsandEvents/Archives/2012/newsitem/4216/24- 27-June-2012-Nineth-International-Conference-on-Co mputability-and-Complexity-in-Analysis-CCA-2012-Ca mbridge-U-K- END:VEVENT END:VCALENDAR