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/2006/newsitem/1275/1-5
 -November-2006-Computability-and-Complexity-in-Ana
 lysis-CCA-2006-Gainesville-Florida-USA
DTSTAMP:20060316T000000
SUMMARY:Computability and Complexity in Analysis (
 CCA 2006), Gainesville, Florida, USA
DTSTART;VALUE=DATE:20061101
DTEND;VALUE=DATE:20061105
LOCATION:Gainesville, Florida, USA
DESCRIPTION:The conference is concerned with the t
 heory of computability and complexity over real-va
 lued data. Unlike the well established classical t
 heory over discrete structures, the theory of comp
 utation over continuous data is still in early sta
 ges of development, despite remarkable progress in
  recent years. Many important fundamental problems
  have not yet been studied, and presumably numerou
 s unexpected and surprising results are waiting to
  be detected. Scientists working in the area of co
 mputation on real-valued data come from different 
 fields, such as theoretical computer science, doma
 in theory, logic, constructive mathematics, comput
 er arithmetic, numerical mathematics and all branc
 hes of analysis. The conference provides a unique 
 opportunity for people from such diverse areas to 
 meet and exchange ideas and knowledge.    For this
  year's meeting, there will be a particular focus 
 on effectively closed sets and on algorithmic rand
 omness.   For more information, see http://cca-net
 .de/cca2006/   The Programme Committee cordially i
 nvites all researchers to submit their papers for 
 presentation. Submission deadline is 2 July 2006.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>\nThe
  conference is concerned with the theory of comput
 ability and complexity\nover real-valued data.\nUn
 like the well established classical theory over\nd
 iscrete structures, the theory of computation over
  continuous data is\nstill in early stages of deve
 lopment, despite remarkable progress in recent\nye
 ars. \nMany important fundamental problems have no
 t yet been studied, and\npresumably numerous unexp
 ected and surprising results are waiting to be\nde
 tected. Scientists working in the area of computat
 ion on real-valued data\ncome from different field
 s, such as theoretical computer science, domain\nt
 heory, logic, constructive mathematics, computer a
 rithmetic, numerical\nmathematics and all branches
  of analysis. The conference provides a unique\nop
 portunity for people from such diverse areas to me
 et and exchange ideas\nand knowledge.\n      </p>\
 n      <p>\nFor this year's meeting, there will be
  a particular focus on effectively\nclosed sets an
 d on algorithmic randomness.\n      </p>\n    \n  
     \n      <p>For more information, see\n        
 <a target="_blank" href="http://cca-net.de/cca2006
 /">http://cca-net.de/cca2006/</a>\n      </p>\n   
  </div><div>\n      <p>\n        The Programme Com
 mittee cordially invites all researchers\n        
 to submit their\n        papers for presentation.\
 n        Submission deadline is 2 July 2006.\n    
   </p>\n      </div>
URL:/NewsandEvents/Archives/2006/newsitem/1275/1-5
 -November-2006-Computability-and-Complexity-in-Ana
 lysis-CCA-2006-Gainesville-Florida-USA
END:VEVENT
END:VCALENDAR