Continuity, Computability, Constructivity - From Logic to Algorihms (CCC 2023), September 25-29, Kyoto
皆様
京都大学の河村と申します。今年9月25日～29日に京都で開催される Continuity, Computability, Constructivity – From Logic to Algorithms (CCC 2023) の講演募集をお送りいたします。投稿締切は7月31日です。
------------------------------------------------------ CALL FOR CONTRIBUTIONS:
CCC 2023: Continuity, Computability, Constructivity – From Logic to Algorithms
Research Institute for Mathematical Sciences, Kyoto University Kyoto, Japan, September 25 - 29, 2023
Conference website: https://www.i.h.kyoto-u.ac.jp/ccc2023/
==============================================
Submission link: https://easychair.org/conferences/?conf=ccc2023
Deadline for Submissions July 31, 2023
Extended abstracts (1-2 pages) of original work should be submitted in pdf format.
====================================================
CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety critical applications and scientific computation.
Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020 (online), Birmingham 2021 (online), and Padova 2022.
========================================================
Invited Speakers:
Takako Nemoto (Tohoku University, Sendai, JP) Linda Westrick (Penn State University, USA) Alexander G. Melnikov (Victoria University of Wellington, NZ) Siegfried M. Rump (Hamburg University of Technology, DE)
========================================================
Contributions
The workshop invites all contributions relating to computation where issues of continuity, computability and constructivity play major roles. Specific areas of interest include:
Exact real number computation Correctness of algorithms on infinite data Computable analysis Complexity of real numbers, real-valued functions, etc. Effective descriptive set theory Domain theory Constructive analysis and topology Constructive foundations Category-theoretic approaches to computation on infinite data Weihrauch degrees Other related areas
Participation is open both in presence and online.
=====================================================================
Programme Committee
Ulrich Berger (Swansea, UK) Daniel Graça (Faro, Portugal) Takayuki Kihara (Nagoya, Japan) Milly Maietti (Padua, Italy) Norbert Müller (Trier, Germany) (chair) Sewon Park (Kyoto, Japan) Svetlana Selivanova (Novosibirsk, Russia) Chuangjie Xu (Munich, Germany) Martin Ziegler (KAIST, Republic of Korea)
Organizing Committee
Matthew de Brecht (Kyoto, Japan) Akitoshi Kawamura (Kyoto, Japan) (co-chair) Sewon Park (Kyoto, Japan) Holger Thies (Kyoto, Japan) (co-chair) Hideki Tsuiki (Kyoto, Japan) Takao Yuyama (Kyoto, Japan)
皆様
来月25日（月）～29日（金）に京都で開催される標記研究集会について、再度ご案内させていただきます。参加登録の締切は9月13日（水）ですが、可能でしたら早めにご登録いただけますと幸いです。
---- CALL FOR PARTICIPATION
CCC 2023: Continuity, Computability, Constructivity – From Logic to Algorithms
Research Institute for Mathematical Sciences, Kyoto University
Kyoto, Japan, September 25 - 29, 2023
Participation can be online or in person and is free of charge.
A link for the registration can be found on the following conference website: https://www.i.h.kyoto-u.ac.jp/ccc2023/
Please register early, so that we can confirm the number of participants.
Deadline for registration: September 13
====================================================
Topics: constructive mathematics, constructive analysis, computable analysis, exact real number computation
CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety critical applications and scientific computation.
========================================================
Invited Speakers:
Johanna Franklin (Hofstra University, USA) Alexander G. Melnikov (Victoria University of Wellington, NZ) Takako Nemoto (Tohoku University, Sendai, JP) Siegfried M. Rump (Hamburg University of Technology, DE) Linda Westrick (Penn State University, USA)
========================================================
Programme Committee
Ulrich Berger (Swansea, UK) Daniel Graça (Faro, Portugal) Takayuki Kihara (Nagoya, Japan) Milly Maietti (Padua, Italy) Norbert Müller (Trier, Germany) (chair) Sewon Park (Kyoto, Japan) Svetlana Selivanova (Novosibirsk, Russia) Chuangjie Xu (Munich, Germany) Martin Ziegler (KAIST, Republic of Korea)
Organizing Committee
Matthew de Brecht (Kyoto, Japan) Akitoshi Kawamura (Kyoto, Japan) (co-chair) Sewon Park (Kyoto, Japan) Holger Thies (Kyoto, Japan) (co-chair) Hideki Tsuiki (Kyoto, Japan) Takao Yuyama (Kyoto, Japan)
-
Akitoshi Kawamura