\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 \nFor more information, see the Conference Web Page at\n http://cca-net.d e/cca2015/\n

\n\n

URL:/NewsandEvents/Events/Conferences/newsitem/616
7/12-15-July-2015-Twelfth-International-Conference
-on-Computability-and-Complexity-in-Analysis-CCA-2
015-Tokyo-Japan
END:VEVENT
END:VCALENDAR
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