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/10809/2-
 --6-September-2019-Workshop-Continuity-Computabili
 ty-Constructivity---From-Logic-to-Algorithms-CCC-2
 019-Ljubljana-Slovenia
DTSTAMP:20190527T134421
SUMMARY:Workshop Continuity, Computability, Constr
 uctivity - From Logic to Algorithms (CCC 2019), Lj
 ubljana, Slovenia
DTSTART;VALUE=DATE:20190902
DTEND;VALUE=DATE:20190906
LOCATION:Ljubljana, Slovenia
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: Hannes D
 iener (Christchurch, New Zealand) , Fabian Immler 
 (Pittsburgh, USA), Florian Steinberg (Paris, Franc
 e), Thomas Streicher (Darmstadt, France) and Holge
 r Thies (Fukuoka, Japan). Tutorial Speaker: Helmut
  Schwichtenberg (Munich, Germany).  Extended abstr
 acts (1-2 pages) of original work are welcome. The
  workshop specifically invites contributions in th
 e areas of Exact real number computation, Correctn
 ess of algorithms on infinite data, Computable ana
 lysis, Complexity of real numbers, real-valued fun
 ctions, etc., Effective descriptive set theory, Do
 main theory, Constructive analysis, Category-theor
 etic approaches to computation on infinite data, W
 eihrauch degrees,  and related areas.
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>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
 .</p>\n\n  <p>Invited Speakers: Hannes Diener (Chr
 istchurch, New Zealand) , Fabian Immler (Pittsburg
 h, USA), Florian Steinberg (Paris, France), Thomas
  Streicher (Darmstadt, France) and Holger Thies (F
 ukuoka, Japan). Tutorial Speaker: Helmut Schwichte
 nberg (Munich, Germany).</p>\n</div><div>\n  <p>Ex
 tended abstracts (1-2 pages) of original work are 
 welcome. The workshop specifically invites contrib
 utions in the areas of Exact real number computati
 on, Correctness of algorithms on infinite data, Co
 mputable analysis, Complexity of real numbers, rea
 l-valued functions, etc., Effective descriptive se
 t theory, Domain theory, Constructive analysis, Ca
 tegory-theoretic approaches to computation on infi
 nite data, Weihrauch degrees,&nbsp; and related ar
 eas.</p>\n</div>
URL:https://www.fmf.uni-lj.si/~simpson/ccc2019
END:VEVENT
END:VCALENDAR