Nineteenth International Conference on Computability and Complexity in Analysis (CCA2022)

Hosted online by Arcadia University, USA [the conference is fully online]

A map screenshot displaying Philadelphia and nearby cities including New York, NY and Washington, DC.

By train from Arcadia University:

  • 30 minutes to downtown Philadelphia
  • 1 hour to Philadelphia International Airport (PHL)

By train from downtown Philadelphia (on amtrak):

  • 1.5 hours to New York, NY
  • 2 hours to Washington, DC

By car from Arcadia University:

  • 25 minutes to downtown Philadelphia
  • 2 hours to New York, NY
  • 2.5 hours to Washington, DC

Map of the Philadelphia region

A map screenshot displaying Philadelphia and nearby cities including New York, NY and Washington, DC.

By train from Arcadia University:

  • 30 minutes to downtown Philadelphia
  • 1 hour to Philadelphia International Airport (PHL)

By train from downtown Philadelphia (on amtrak):

  • 1.5 hours to New York, NY
  • 2 hours to Washington, DC

By car from Arcadia University:

  • 25 minutes to downtown Philadelphia
  • 2 hours to New York, NY
  • 2.5 hours to Washington, DC

Registration and Agenda

Please fill out this form to receive a Zoom link and register for the online participation. The agenda is available at the bottom of this page.


Contacts

Location: Arcadia University, Glenside, PA, USA

Dates: May 23 - 26, 2022

Organizing Committee: Vitaly Ford, Emily Marshall, Weihong Ni and Xizhong Zheng [Chair of the Organizing Committee]
Emails: {fordv, marshalle, niw, zhengx} @ arcadia.edu

Contact email: cca2022@arcadia.edu

General CCA webpage: http://cca-net.de/cca2022

Submission

Authors are invited to submit 1-2 pages abstracts in PDF format, including references via the following web page:

Topics

  • Computable analysis
  • Complexity on real numbers
  • Constructive analysis
  • Domain theory and analysis
  • Effective descriptive set theory
  • Theory of representations
  • Computable numbers, subsets and functions
  • Randomness and computable measure theory
  • Models of computability on real numbers
  • Realizability theory and analysis
  • Reverse analysis
  • Weihrauch complexity
  • Real number algorithms
  • Implementation of exact real number arithmetic

Dates

  • Submission deadline: March 21, 2022
  • Notification to authors: April 18, 2022
  • Final version: May 9, 2022

Invited speakers

  • Verónica Becher (Buenos Aires, Argentina)
  • Jun Le Goh (Madison, USA)
  • Isaac Goldbring (Irvine, USA)
  • Daniel Graça (Faro, Portugal)
  • Vassils Gregoriades (Athens, Greece)
  • Elvira Mayordomo (Zaragoza, Spain)
  • Alexander Melnikov (Wellington, New Zealand)
  • Henry Towsner (Philadelphia, USA)

Steering Committee

  • Vasco Brattka, chair (Munich, Germany and Cape Town, South Africa)
  • Peter Hertling (Munich, Germany)
  • Akitoshi Kawamura (Fukuoka, Japan)
  • Klaus Weihrauch (Hagen, Germany)
  • Ning Zhong (Cincinnati, USA)
  • Martin Ziegler (Daejeon, Republic of Korea)

Scientific Program Committee

  • Vasco Brattka, chair (Munich, Germany)
  • Douglas Cenzer (Gainesville, USA)
  • Cameron Freer (Boston, USA)
  • Mathieu Hoyrup (Nancy, France)
  • Zvonko Iljazović (Zagreb, Croatia)
  • Takayuki Kihara (Nagoya, Japan)
  • Ulrich Kohlenbach (Darmstadt, Germany)
  • Neil Lutz (Philadelphia, USA)
  • Timothy McNicholl (Ames, USA)
  • Svetlana Selivanova (Daejeon, Republic of Korea)

Timezone info

Slides are available here

Calendar