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/2010/newsitem/2837/17-
 20-February-2010-Workshop-on-Logical-Approaches-to
 -Barriers-in-Computing-and-Complexity-Greifswald-G
 ermany
DTSTAMP:20090817T000000
SUMMARY:Workshop on "Logical Approaches to Barrier
 s in Computing  and Complexity", Greifswald, Germa
 ny
DTSTART;VALUE=DATE:20100217
DTEND;VALUE=DATE:20100220
LOCATION:Greifswald, Germany
DESCRIPTION:Computability theory and complexity th
 eory have their origins in logic. Famous names suc
 h as Goedel, Turing, Cook, and Kolmogorov connect 
 these areas of computer science to foundations of 
 mathematics. The fundamental goal of this area is 
 to understand the limits of computability (that is
  analysing which problems can be solved on nowaday
 s and future computers in principle) and effective
  computability (that is understanding the class of
  problems which can be solved quickly and with res
 tricted resources) where the most famous open prob
 lem is the P=NP-problem. Logic provides a multifar
 ious toolbox of techniques to analyse questions li
 ke this, some of which promise to provide a deep i
 nsight in the structure of limit of computation.  
  In our workshop, we shall focus on the following 
 aspects: logical descriptions of complexity (e.g.,
  descriptive complexity, bounded arithmetic), comp
 lexity classes of abstract, algebraic and infinite
  structures, barriers in proving complexity result
 s, and Kolmogorov complexity and randomness.   Som
 e of these aspects are particularly timely: recent
 ly, research in these areas became more intense. P
 art of this is the new conference series CiE (run 
 by the Association for Computability in Europe) wh
 ose range of interests includes those of our works
 hop, creating an important focus on the emerging t
 opics of the field. This workshop is intended as a
  research-oriented follow-up to the CiE conference
 s, allowing researchers ample time for discussions
  and joint work.   For more information, see http:
 //www.cs.swan.ac.uk/greifswald2010/  The Programme
  Committee cordially invites all researchers in th
 e area of the workshop to submit their extended ab
 stracts (in PDF-format, at most 4 pages) for prese
 ntation at the workshop. Submission deadline is 15
  October 2009.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>Compu
 tability theory and complexity theory have their o
 rigins\n        in logic. Famous names such as Goe
 del, Turing, Cook, and\n        Kolmogorov connect
  these areas of computer science to foundations\n 
        of mathematics. The fundamental goal of thi
 s area is to understand\n        the limits of com
 putability (that is analysing which problems can\n
         be solved on nowadays and future computers
  in principle) and\n        effective computabilit
 y (that is understanding the class of\n        pro
 blems which can be solved quickly and with restric
 ted\n        resources) where the most famous open
  problem is the P=NP-problem.\n        Logic provi
 des a multifarious toolbox of techniques to analys
 e\n        questions like this, some of which prom
 ise to provide a deep\n        insight in the stru
 cture of limit of computation.\n      </p>\n      
 <p>In our workshop, we shall focus on the followin
 g aspects: logical\n        descriptions of comple
 xity (e.g., descriptive complexity, bounded\n     
    arithmetic), complexity classes of abstract, al
 gebraic and\n        infinite structures, barriers
  in proving complexity results, and\n        Kolmo
 gorov complexity and randomness.\n      </p>\n    
   <p>Some of these aspects are particularly timely
 : recently, research\n        in these areas becam
 e more intense. Part of this is the new\n        c
 onference series CiE (run by the Association for C
 omputability\n        in Europe) whose range of in
 terests includes those of our\n        workshop, c
 reating an important focus on the emerging topics 
 of\n        the field. This workshop is intended a
 s a research-oriented\n        follow-up to the Ci
 E conferences, allowing researchers ample time\n  
       for discussions and joint work.\n      </p>\
 n    \n      \n      <p>For more information, see\
 n        <a target="_blank" href="http://www.cs.sw
 an.ac.uk/greifswald2010/">http://www.cs.swan.ac.uk
 /greifswald2010/</a>\n      </p>\n    </div><div>\
 n      <p>The Programme Committee cordially invite
 s all researchers in the\n        area of the work
 shop to submit their extended abstracts\n        (
 in PDF-format, at most 4 pages) for presentation a
 t the workshop.\n        Submission deadline is 15
  October 2009.\n      </p>\n      </div>
URL:/NewsandEvents/Archives/2010/newsitem/2837/17-
 20-February-2010-Workshop-on-Logical-Approaches-to
 -Barriers-in-Computing-and-Complexity-Greifswald-G
 ermany
END:VEVENT
END:VCALENDAR