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/2017/newsitem/8428/24- --27-July-2017-Fourteenth-International-Conference -on-Computability-and-Complexity-in-Analysis-CCA-2 017-Daejeon-South-Korea DTSTAMP:20161205T134843 SUMMARY:Fourteenth International Conference on Co mputability and Complexity in Analysis (CCA 2017), Daejeon, South Korea DTSTART;VALUE=DATE:20170724 DTEND;VALUE=DATE:20170727 LOCATION:Daejeon, South Korea DESCRIPTION:The conference is concerned with the t heory of computability and complexity over real-va lued data. Scientists working in the area of compu tation on real-valued data come from different fie lds, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opp ortunity for people from such diverse areas to mee t, present work in progress and exchange ideas and knowledge. The topics of interest include founda tional work on various models and approaches for d escribing computability and complexity over the re al numbers. They also include complexity-theoretic investigations, both foundational and with respec t to concrete problems, and new implementations of exact real arithmetic, as well as further develop ments of already existing software packages. We ho pe to gain new insights into computability-theoret ic aspects of various computational questions from physics and from other fields involving computati ons over the real numbers. Authors are invited to submit 1-2 pages abstracts in PDF format, includi ng references. Submission deadline: April 3, 2017. X-ALT-DESC;FMTTYPE=text/html:
The confe rence is concerned with the theory of computabilit y and complexity over real-valued data. Scientists working in the area of computation on real-valued data come from different fields, such as theoreti cal computer science, domain theory, logic, constr uctive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The con ference provides a unique opportunity for people f rom such diverse areas to meet, present work in pr ogress and exchange ideas and knowledge.
\n\nThe topics of interest include foundational wor k on various models and approaches for describing computability and complexity over the real numbers . They also include complexity-theoretic investiga tions, both foundational and with respect to concr ete problems, and new implementations of exact rea l arithmetic, as well as further developments of a lready existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics a nd from other fields involving computations over t he real numbers.
Authors are invited to submit 1-2 pages abstracts in PDF forma t, including references. Submission deadline: Apri l 3, 2017.