Conferences  >  Informatics  >  Information Theory, Foundations of Computer Science

The Fields Institute for Research in Mathematical Sciences

The Copmutational Complexity Conference (CCC) aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and nonuniform models; Boolean, algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and machine learning. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.

International Association of Ontology and its Applications (IAOA)

08-12 September 2025 (Catania, Italy), 04-05 September 2025 (online)

Algorithms and Data Structures,    Information & Knowledge Management, Big Data Computing

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

The Symposium is organised by the TSU Razmadze Mathematical Institute, the Centre for Language, Logic and Speech at the Tbilisi State University, the Georgian Academy of Sciences, the Institute for Logic, Language and Computation (ILLC) of the University of Amsterdam.

Mathematical Logic and Foundations,    Linguistics

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Graph Theory and Combinatorics,    Probability and Statistics, Game Theory

An international autumn school "Proof and Computation" will be held from 14th to 20th September 2025 at Haus der bayerischen Landwirtschaft in Herrsching near Munich. Its aim is to bring together young researchers in the fields of Foundations of Mathematics, Computer Science and Philosophy.

Automated Theorem Proving,    Courses and Events for Math Students and Early Career Researchers

The conference is concerned with the theory of computability and complexity over real-valued data. Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded. Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Despite remarkable progress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

Algebra,    Number Theory, Arithmetic

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

This GI-Dagstuhl Seminar aims to bring together junior researchers from different research areas related to the modeling and analysis of stochastic hybrid systems. The involved communities address quantitative modeling, the verification of (stochastic) hybrid systems, and statistical model checking. The seminar will cover intersecting research questions around semantics, tool interoperability, benchmarking, and reproducibility. Its goal is to launch discussions, the exchange of ideas, and fruitful collaborations with an emphasis on networking and the training of the participating young scientists to strengthen their qualifications and skills.

Hybrid systems; Stochastic systems; Formal methods; Modeling; Verification; Formal Languages and Automata Theory

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

Mu-calculi are logical systems for reasoning about inductive and co-inductive constructions. They link a number of important fields in mathematics and theoretical computer science: arithmetic, recursion theory, temporal and spatial logics, topology, infinite games, descriptive set theory, and automata theory. The purpose of this Dagstuhl Seminar is to bring together experts from these fields to discuss connections and encourage new avenues of interdisciplinary collaboration.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH

This Dagstuhl Seminar seeks to extend and deepen the convergence across disciplinary boundaries by fostering exchange and collaboration among the relevant experts and practitioners, uniting expertise in proof theory with proof complexity, categorical semantics, constructive mathematics, proof mining, program extraction, and automated theorem proving. By bridging these domains, we seek to empower the next generation of researchers to frame and connect their work within this converging landscape, ultimately advancing the computational applications of proof systems in both theoretical and practical contexts.

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

Information theory aims to find mathematically precise answers to fundamental questions such as how information is stored, processed, or sent reliably through noisy communication links. Towards the end of the 20th century, researchers started asking how these information-processing tasks change when information is encoded in systems exhibiting quantum-mechanical behavior. Remarkably, features of quantum mechanics such as the superposition principle and entanglement give rise to phenomena in information theory that cannot be realized with classical information-processing systems. Their discovery has led to the creation of the now thriving field of quantum information theory. A cornerstone of quantum information theory is the principle of non-additivity of information measures. Roughly speaking, non-additivity occurs if a communication resource becomes more powerful when used repeatedly or in conjunction with another resource. On the one hand, non-additivity effects are desirable as they push the limits of faithfully communicating information. On the other hand, they complicate an exact characterization of these limits in both mathematical and computational terms. Our workshop gathers experts from all areas of quantum information theory, with the goal of shedding further light on, and identifying new methods to study, the nature of non-additivity phenomena in quantum information-processing systems.