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/2019/newsitem/10427/8- --11-July-2019-Sixteenth-International-Conference- on-Computability-and-Complexity-in-Analysis-CCA-20 19-Zagreb-Croatia DTSTAMP:20181217T124437 SUMMARY:Sixteenth International Conference on Com putability and Complexity in Analysis (CCA 2019), Zagreb, Croatia DTSTART;VALUE=DATE:20190708 DTEND;VALUE=DATE:20190711 LOCATION:Zagreb, Croatia DESCRIPTION:The conference is concerned with the t heory of computability and complexity over real-va lued data. Most mathematical models in physics an d engineering are based on the real number concept . Thus, a computability theory and a complexity th eory over the real numbers and over more general c ontinuous data structures is needed. Scientists wo rking in the area of computation on real-valued da ta come from different fields, such as theoretical computer science, domain theory, logic, construct ive mathematics, computer arithmetic, numerical ma thematics and all branches of analysis. The confer ence provides a unique opportunity for people from such diverse areas to meet, present work in progr ess and exchange ideas and knowledge. The confere nce CCA 2019 is followed by the conference Computa bility in Europe (CiE 2019). Authors are invited to submit 1-2 pages abstracts in PDF format. Topi cs: Computable analysis, Complexity on real number s, Constructive analysis, Domain theory and analys is, Effective descriptive set theory, Theory of re presentations, Computable numbers, subsets and fun ctions, Randomness and computable measure theory, Models of computability on real numbers, Realizabi lity theory and analysis, Reverse analysis, Weihra uch complexity, Real number algorithms, Implementa tion of exact real number arithmetic. X-ALT-DESC;FMTTYPE=text/html:
The confe rence is concerned with the theory of computabilit y and complexity over real-valued data.
\n\n < p>Most mathematical models in physics and engineer ing are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Scientists working in t he area of computation on real-valued data come fr om different fields, such as theoretical computer science, domain theory, logic, constructive mathem atics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provi des a unique opportunity for people from such dive rse areas to meet, present work in progress and ex change ideas and knowledge.\n\nThe confer ence CCA 2019 is followed by the conference Comput ability in Europe (CiE 2019).
Authors are invited to submit 1-2 pages abstracts in PDF format.
\n\nTopics: Computable ana lysis, Complexity on real numbers, Constructive an alysis, Domain theory and analysis, Effective desc riptive set theory, Theory of representations, Com putable numbers, subsets and functions, Randomness and computable measure theory, Models of computab ility on real numbers, Realizability theory and an alysis, Reverse analysis, Weihrauch complexity, Re al number algorithms, Implementation of exact real number arithmetic.