Supported by the National Science FoundationPalm Frond

CCA 2006: Computability and Complexity in Analysis

November 1--5, 2006

Meeting Information:

The conference is concerned with the theory of computability and complexity with a special focus on algorithmic randomness and effectively closed sets.

Invited Speakers

  • Douglas Bridges (Christchurch, NZ)
  • Rod Downey (Wellington University, NZ)
  • Ed Griffor (Michigan, USA)
  • Ker-I Ko (SUNY Buffalo, USA)
  • Anil Nerode (Ithaca, NY, USA)
  • Robert Soare (Chicago, USA)

Scientific Program Committee

  • Andrej Bauer (Ljubljana University, Slovenia)
  • Arthur Chou (Clark University)
  • Rod Downey (Wellington University, New Zealand)
  • Abbas Edalat (Imperial College, London)
  • Denis Hirschfeldt (University of Chicago, Illinois, USA)
  • Iraj Kalantari (Western Illinois University, USA)
  • Hiroyasu Kamo (Nara University, Japan)
  • Joe Miller (University of Connecticut, USA)
  • Anil Nerode (Cornell University, USA)
  • Jeff Remmel (University of California, San Diego, USA)
  • Klaus Weihrauch, chair (Hagen University, Germany)

Local Organizing Committee:

  • Paul Brodhead (Gainesville, Florida)
  • Douglas Cenzer, chair (Gainesville, Florida)
  • Rick Smith (Gainesville, Florida)

 

 

Last modified: Thu Dec 1 10:56:26 EST 2005
logicyear@clas.ufl.edu