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/2015/newsitem/6167/12- 15-July-2015-Twelfth-International-Conference-on-C omputability-and-Complexity-in-Analysis-CCA-2015-T okyo-Japan DTSTAMP:20150110T000000 SUMMARY:Twelfth International Conference on Comput ability and Complexity in Analysis (CCA 2015), Tok yo, Japan DTSTART;VALUE=DATE:20150712 DTEND;VALUE=DATE:20150715 LOCATION:Tokyo, Japan DESCRIPTION:The conference is concerned with the t heory of computability and complexity over real-va lued data. The classical approach in these areas i s to consider algorithms as operating on finite st rings of symbols from a finite alphabet. Most math ematical models in physics and engineering, howeve r, are based on the real number concept. Thus, a c omputability theory and a complexity theory over t he real numbers and over more general continuous d ata structures is needed. Despite remarkable pr ogress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are wa iting to be detected. Scientists working in the ar ea of computation on real-valued data come from di fferent fields, such as theoretical computer scien ce, domain theory, logic, constructive mathematics , computer arithmetic, numerical mathematics and a ll branches of analysis. The conference provides a unique opportunity for people from such diverse a reas to meet, present work in progress and exchang e ideas and knowledge. For more information, see the Conference Web Page at http://cca-net.de/cca2 015/ Authors are invited to submit 1-2 pages abst racts in PDF format by March 31st. Contributions a bout Descriptive Set Theory and Continuous/Borel R eduction are especially welcome. X-ALT-DESC;FMTTYPE=text/html:
\n

\n The conference is concerned with the theory o f computability\n and complexity over real- valued data. The classical approach\n in th ese areas is to consider algorithms as operating o n\n finite strings of symbols from a finite alphabet. Most\n mathematical models in ph ysics and engineering, however, are\n based on the real number concept. Thus, a computability theory\n and a complexity theory over the real numbers and over more\n general contin uous data structures is needed.\n

\n < p>\n Despite remarkable progress in recent y ears many important\n fundamental problems h ave not yet been studied, and presumably\n n umerous unexpected and surprising results are wait ing to be\n detected. Scientists working in the area of computation on\n real-valued dat a come from different fields, such as\n theo retical computer science, domain theory, logic,\n constructive mathematics, computer arithmeti c, numerical\n mathematics and all branches of analysis. The conference\n provides a uni que opportunity for people from such diverse\n areas to meet, present work in progress and exc hange ideas and\n knowledge.\n

\n \n \n

For more information, see the Conference Web Page at\n http://cca-net.d e/cca2015/\n

\n
\n

Authors are invited to submit 1-2 pages abstra cts in PDF\n format by March 31st. Contribut ions about Descriptive Set\n Theory and Conti nuous/Borel Reduction are especially welcome.\n

\n
URL:/NewsandEvents/Archives/2015/newsitem/6167/12- 15-July-2015-Twelfth-International-Conference-on-C omputability-and-Complexity-in-Analysis-CCA-2015-T okyo-Japan END:VEVENT END:VCALENDAR