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/2021/newsitem/12850/19 ---24-September-2021-Workshop-Continuity-Computabi lity-Constructivity---From-Logic-to-Algorithms-CCC -2021-Virtual DTSTAMP:20210622T152610 SUMMARY:Workshop Continuity, Computability, Constr uctivity - From Logic to Algorithms (CCC 2021) , V irtual DTSTART;VALUE=DATE:20210919 DTEND;VALUE=DATE:20210924 LOCATION:Virtual DESCRIPTION:CCC is a workshop series that brings t ogether researchers applying logical methods to th e development of algorithms, with a particular foc us on computation with infinite data, where issues of continuity, computability and constructivity p lay major roles. Specific topics include exact rea l number computation, computable analysis, effecti ve descriptive set theory, constructive analysis, and related areas. The overall aim is to apply log ical methods in these disciplines to provide a sou nd foundation for obtaining exact and provably cor rect algorithms for computations with real numbers and other continuous data, which are of increasin g importance in safety critical applications and s cientific computation. Invited Speakers: Suguman Bransal (U Penn), Franz Brauße (U Manchester), Sew on Park (KAIST), Monika Seisenberger (Swansea U) a nd Michael Yampolsky (U Toronto). Tutorial Speaker : André Platzer (CMU). Extended abstracts (1-2 pa ges) of original work are welcome. The workshop sp ecifically invites contributions in the areas of E xact real number computation, Correctness of algor ithms on infinite data, Computable analysis, Compl exity of real numbers, real-valued functions, etc. Effective descriptive set theory, Domain theory, Constructive analysis, Category-theoretic approach es to computation on infinite data, Weihrauch degr ees, And related areas. X-ALT-DESC;FMTTYPE=text/html:
CCC is a workshop series that brings together researchers a pplying logical methods to the development of algo rithms, with a particular focus on computation wit h infinite data, where issues of continuity, compu tability and constructivity play major roles. Spec ific topics include exact real number computation, computable analysis, effective descriptive set th eory, constructive analysis, and related areas. Th e overall aim is to apply logical methods in these disciplines to provide a sound foundation for obt aining exact and provably correct algorithms for c omputations with real numbers and other continuous data, which are of increasing importance in safet y critical applications and scientific computation .
\n\nInvited Speakers: Suguman Bransal (U Penn), Franz Brauße (U Manchester), Sewon Pa rk (KAIST), Monika Seisenberger (Swansea U) and Mi chael Yampolsky (U Toronto). Tutorial Speaker: And ré Platzer (CMU).
Extended ab stracts (1-2 pages) of original work are welcome. The workshop specifically invites contributions in the areas of Exact real number computation, Corre ctness of algorithms on infinite data, Computable analysis, Complexity of real numbers, real-valued functions, etc. Effective descriptive set theory, Domain theory, Constructive analysis, Category-the oretic approaches to computation on infinite data, Weihrauch degrees, And related areas.