Computability in Europe CiE 2026: Timeless Machines / Computability Across Eras
Computability in Europe (CiE) is a conference series interfacing informatics and mathematics. For more information on this conference series, look here. The 22nd edition of CiE will take place at Trier University, July 27.-31., 2026. CiE 2026 will be chaired by Henning Fernau and Vasco Brattka (Munich). During the CiE conference, the Annual Meeting of the Association CiE will take place, as well as the Meeting “Women in Computability.” Registration Link
CiE 2026 Colocation with Other Conferences
Organizational Aspects
- The conference will take place on Campus 1 at Trier University.
- There are only very few hotels close to the campus, but it is well connected by bus to the city center.
- The university has no special deals with any hotels, but as hotel prices tend not to be low in Trier, it is advisable to make reservations as early as possible.
- It is not that easy to reach Trier by public transport. Therefore, try to arrive on SUN as otherwise you can be sure to miss nearly all talks on MON (for example). The closest international airport is LUX. Public transport within Luxembourg is free, see http://mobiliteit.lu/.
Preliminary Program of CiE and MCU 2026
MON, July 27th
| 8.00-8.45 | Registration Desk (A/B Area) | ||
| 8.45-9.05 | HS 2 | Welcome Address, Organizational Information | |
| 9.10-10.40 | Special Sessions I | ||
| HS 2 | Quantum Computing and Information | organized by Mika Hirvensalo | |
| Mika Hirvensalo | Finite Automata: From Classical to Quantum (On Invitation by MCU) | ||
| HS 1 | At the Borderline of Universality | organized by Erzsébet Csuhaj-Varjú & Serghei Verlan | |
| 9.10-10.40 | B22 | Contributed Talks CiE: Proofs and Logic | |
| Samuel German | Jump-Theoretic Boundaries for Explanatory Learning of Σ⁰₁-Definable Sets in Computable Equivalence Structures | ||
| Giulio Fellin, Sara Negri, Peter Schuster | Nuclear Shifts for Conservation | ||
| Makoto Fujiwara | On the Sigma-Hierarchy of the Logical Principles Over Intuitionistic Predicate Logic | ||
| 10.45-11.10 | A/B Mensa | Coffee Break | |
| 11.10-12.40 | Contributed Talks CiE & MCU | ||
| HS 2 | Traces of Randomness | ||
| Mikhail Andreev, Alexander Shen | Bishop’s (Up)crossing Inequality and Lower Semicomputable Random Reals Revisited | ||
| Neil Lutz, Spencer Park Martin, Rain White | Lines in Every Direction with No ee-Random Points | ||
| Yash Belani | Systematic Expansion of Robust Randomness Tests via AI-Assisted Implementation | ||
| HS 1 | Aspects of Computability | ||
| Ivan Georgiev | Characterization of Computable Irrationality | ||
| Patrick Uftring | The More Gödels, the Better | ||
| (online) | Nikolay Bazhenov, Manat Mustafa, Stanislav Yun | On Computability of Ideal Lattices | |
| B21 | MCU: Beyond One Dimension | ||
| Eric Goles, Augusto Modanese, Martín Ríos-Wilson, Domingo Ruiz, Thomas Worsch | Embedding Boolean Circuits Into Fungal Automata With Arbitrary Update Sequences | ||
| Taylor Smith | Complexity of Universality and Related Decision Problems for Unary Two-Dimensional Automata | ||
| M Gayathri Lakshmi, Kalyani T, D Gnanaraj Thomas | On Generative Powers of Parallel Contextual Array Insertion Deletion P Systems and Pure 2D Eilenberg P Systems | ||
| 12.40-13.40 | Mensa | Lunch Break | |
| 13.40-15.10 | Special Sessions II | ||
| HS 2 | Quantum Computing and Information | organized by Mika Hirvensalo | |
| Jaroslaw Miszczak | Quantum Random Numbers and Where to Find Them | ||
| Abuzer Yakaryilmaz | QIP ⊆ AM(2QCFA) | ||
| HS 1 | At the Borderline of Universality | organized by Erzsébet Csuhaj-Varjú & Serghei Verlan | |
| 15.10-15.35 | A/B Mensa | Coffee Break | |
| 15.35-16.35 | Invited Talks: CiE and MCU | ||
| HS 3 | Johanna Franklin (Hempstead, NY, USA) | Highness for Scott Rank | |
| HS 2 | Martin Kutrib (Gießen, Germany) | Reversible Machines -- How Much Does It Cost to Keep Coming Back? | |
| 16.35-16.45 | Short Break | ||
| 16.45-18.15 | Contributed Talks CiE & MCU | ||
| HS 1 | Reverse Mathematics | ||
| Luca Facchinetti | New Results About Reverse Mathematics and WQO Definitions | ||
| Sam Sanders | On the Reverse Mathematics of Darboux's Supremum Principle | ||
| Andrea Volpi | Reverse Mathematics and Dimension of Posets | ||
| HS 2 | The Real Stuff | ||
| Peter Hertling, Leonard Schulte-Michels | Closure Properties of Left NP Real Numbers and NP Real Functions | ||
| Philip Janicki | Tadaki Numbers and Speedability | ||
| Eike Neumann, Margret Tembo | Termination of Real Linear Loops | ||
| HS 3 | Strings and Machines | ||
| Julianne Cruz, Sho Glashausser, Xiaoyuan Li, Neil Lutz | Adaptive Multi-Head Finite-State Gamblers | ||
| Florin Manea, Tina Ringleb, Stefan Siemer, Maximilian Winkler | Efficiently Finding All Shortest Absent Subsequences in a String | ||
| Katalin Lazar, Florin Manea, Stefan Siemer, Timo Specht | Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure under Self-assembly | ||
| B21 | MCU: Formal Languages | ||
| Rudolf Freund, Artiom Alhazov, Sergiu Ivanov | Simple P Systems with Non-negative Activation and Blocking of Rules | ||
| Benedek Nagy | On 5'->3' String Assembly Systems | ||
| Marco B. Caminati | A Strengthening of the MCFL-ness of O2 |
TUE, July 28th
| 8.30-9.00 | Registration Desk | ||
| 9.00-10.00 | Invited Talk CiE | ||
| HS 3 | Mathieu Hoyrup (Nancy, France) | Presentations of Topological Spaces | |
| HS 1 | Contributed Talks MCU: The Real Stuff | ||
| Jihoon Hyun, Holger Thies, Martin Ziegler | Towards Algorithmic Cost in Exact Real Computation | ||
| Georgii Sirotenko, Ivan Titov | S2a-reducibility and Differentiation in Martin-Löf Random Reals | ||
| 10.00-10.30 | A/B Mensa | Coffee Break | |
| 10.30-12.00 | Contributed Talks CiE & MCU | ||
| HS 1 | Contributed Talks MCU: Aspects of Automata | ||
| Markus Holzer, Michal Hospodár, Viktor Olejár | Accepting-State Spectrum of Proportional Removals and Additions on Subregular Language Classes | ||
| Julianne Cruz, Sho Glashausser, Neil Lutz | One Adaptive Trailing Head Can Outperform Many Oblivious Trailing Heads | ||
| Michael Wehar, András Z. Salamon | A Collection of Slowest Growing Computable Functions | ||
| HS 2 | Contributed Talks CiE: Structures | ||
| Riccardo Borsetto, Giulio Fellin, Tarmo Uustalu, Cheng-Syuan Wan | Glivenko’s Theorem Underneath Structure | ||
| Merlin Carl | Complexity of Effective Reductions with Ordinal Turing Machines | ||
| Valentina Harizanov, Keshav Srinivasan | Cohesive Powers of Function Structures | ||
| HS 3 | Contributed Talks CiE: Functions | ||
| Fateme Ghasemi, W. F. Smyth, Jeffery Zucker | WhileCC-Approximability and Acceptability of Elementary Functions | ||
| Sam Sanders, Dag Normann | On the Computational Properties of Ambivalent Sets and Functions | ||
| Aras Bacho, Svetlana Selivanova and Martin Ziegler | What is a POLYNOMIAL-TIME Computable Square-Integrable Function? | ||
| B22 | Contributed Talks CiE: Bridging Theory and Applications | ||
| Reino Niskanen, Igor Potapov, James Topley | Safety and Reachability in k-Control Games on Integer Vector Addition Systems with States | ||
| Gero Ellmies, Till Fluschnik | Placing Green Bridges Optimally for Robust Habitat Reconnection | ||
| Katalin Friedl, Levente Gegő, László Kabódi, Viktória Nemkin | Succinct QUBO Formulations for Permutation Problems by Sorting Networks | ||
| 12.00-13.00 | Mensa | Lunch Break | |
| 13.00-14.30 | Special Sessions III | ||
| HS 2 | Groups and Computability | organized by Laura Ciobanu & André Nies | |
| Arman Darbinyan | The Computability and Geometry of the Word Problem in Groups | ||
| Turbo Ho | Word Problems and the Structure of Computably Enumerable Equivalence Relations | ||
| HS 3 | Natural Computation and Bioinformatics | organized by Karel Brinda & Giuditta Franco | |
| 14.30-15.00 | A/B Mensa | Coffee Break | |
| 15.00-16.30 | Special Sessions IV | ||
| HS 2 | Groups and Computability | organized by Laura Ciobanu & André Nies | |
| Emmanuel Rauzy | Residual Properties of Groups in the Continuous Weihrauch Lattice | ||
| Alex Thumm | Solving Equations in Groups | ||
| HS 3 | Natural Computation and Bioinformatics | organized by Karel Brinda & Giuditta Franco | |
| 16.30-16.40 | Short Break | ||
| 16.40-18.10 | HS 3 | Women in Computability | |
| HS 2 | Contributed Talks MCU | ||
| Matteo Palazzo, Robert Glück, Luca Roversi | A List-Based Primitive Recursive Programming Language and its Timed Self-Interpreter | ||
| Soowhan Yoon | Graetzer-Schmidt Theorem in Arithmetical Transfinite Recursion | ||
| (online) | Victor Selivanov | Non-Collapse of the Fine Hierarchy of Sentences |
WED, July 29th (Separate Program for CCA (HS 1))
| 8.00-8.45 | Registration Desk | ||
| 8.20-8.50 | HS 2 | Contributed Talk MCU | |
| Eduardo Skapinakis, Philip Boeken, Konstantin Genin | Statistics meets Computability | ||
| B21 | Contributed Talk CiE | ||
| Jan Philipp Wächter | Context-Free Trees | ||
| 9.00-11.00 | HS 3 | Tutorial Session CiE / MCU / CCA | |
| Olivier Bournez (Paris, France) | Ordinary Differential Equations as a Universal Language for Computability and Complexity: From Polynomial Time to the Hyperarithmetical Hierarchy | ||
| 11.00-11.30 | A/B Mensa | Coffee Break | |
| 11.30-12.45 | HS 3 | Best Student Paper Presentations CiE | |
| Katalin Anna Lázár, Florin Manea, Stefan Siemer, Timo Specht | Self-assembly of Strings and Languages Revisited: Efficient Membership Algorithms | ||
| Antonio Nakid Cordero, Isabella Scott | Comparing the Effective Content of Subshifts | ||
| 11.30-13.00 | HS 2 | Contributed Talks MCU | |
| Aliénor Goubault-Larrecq, Kévin Perrot, Colin Geniet | Complexity Lower Bounds for Succinct Binary Structures of Bounded Clique-width With Restrictions | ||
| Péter Battyányi | Reaction Systems With Approximation Spaces | ||
| (online) | Guohua Wu, Jia Li Zheng | Computability-theoretic Aspects of the Convergence Rank | |
| 13.00-14.00 | Mensa | Lunch Break | |
| 14.00 | Forumsplatte | Start of the Excursion | |
| 18.00 | https://frueh-bis-spaet-trier.de/ | Conference Dinner |
THU, July 30th (Separate Programs for CCA (HS 1) and for GSW (B21))
| 8.30-9.00 | Registration Desk | ||
| 9.00-11.00 | HS 3 | Tutorial Session CiE / GSW | |
| Georg Zetzsche (Kaiserslautern, Germany) | General Decidability Results on Unboundedness Problems | ||
| 11.00-11.30 | A/B Mensa | Coffee Break | |
| 11.30-13.00 | HS 3 | Special Session V | |
| Learning Theory Meets Computability Theory | organized by Cameron Freer & Sandra Zilles | ||
| Dana Fisman | Learning Omega-Regular Languages: A Tour of Learning Results and Canonical Representations | ||
| Ruth Urner | CPAC: A Brief Tale about a New Paradigm of Learnability | ||
| HS 2 | Contributed Talks CiE: Spaces | ||
| Arno Pauly | Mergeable Represented Spaces | ||
| Matthew de Brecht | A Note on Computable Etale Spaces | ||
| Steffen Lempp | The Theory of the Ziegler Degrees | ||
| B22 | Contributed Talks CiE: Finite Automata | ||
| Jana Schulz | Non-Forgetting Parallel Communicating Finite Automata Systems | ||
| Anton Lipin, Mikhail Volkov | Adversarial Synchronization and Reset Length | ||
| Igor Rystsov | Synchronizing Words on Product Automata | ||
| 13.00-14.00 | Mensa | Lunch Break | |
| 14.00-15.00 | Invited Talk CiE | ||
| HS 3 | Francesca Zaffora Blando (Pittsburgh, USA) | Algorithmic Randomness and Weak Merging of Opinions | |
| 15.00-15.30 | A/B Mensa | Coffee Break | |
| 15.30-16.30 | Invited Talk CiE | ||
| HS 3 | Luca San Mauro (Bari, Italy) | Left and Right Effective Symmetries on Baire and Cantor Space | |
| Invited Talk GSW | |||
| HS 2 | Erzsébet Csuhaj-Varjú (Budapest, Hungary) | Eco-Grammar Systems: Models, Results, Perspectives | |
| 16.30-16.40 | Short Break | ||
| 16.40- | HS 3 | aCiE Annual Business Meeting |
FRI, July 31st (Separate Programs for CCA (HS 1) and for GSW (B21))
| 9.00-10.30 | Special Sessions VI | ||
| HS 3 | Learning Theory Meets Computability Theory | organized by Cameron Freer & Sandra Zilles | |
| Alexander Kozachinskiy | Efficient Dimensions for Efficient Learning and Generation | ||
| Kevin Kelly | Topological Foundations for Inductive Learnability | ||
| HS 2 | New French Philosophy of Computing (HaPoC) | organized by Hajo Greif | |
| 10.30-11.00 | A/B Mensa | Coffee Break | |
| 11.00-12.00 | Invited Talk CiE | ||
| HS 3 | Albert Atserias (Barcelona, Spain) | Circuit Complexity Theory in Models of Bounded Arithmetic | |
| 12.00-13.00 | Mensa | Lunch Break | |
| 13.00-14.30 | HS 3 | Contributed Talks CiE: Algorithms and Complexity | |
| Ludwig Staiger | A Polynomial-Time Algorithm for the Automatic Baire Property | ||
| Mario Grobler, Nils Morawietz and Silas Cato Sacher | Towards Settling the Complexity of the Lettericity Problem | ||
| Abhishek Krishnamoorthy, Robinson Thamburaj, Durairaj Gnanaraj Thomas | Combinatorial Properties of Christoffel and Stern–Brocot Trees With Applications to RSA | ||
| HS 2 | Contributed Talks CiE | ||
| Michał Wrocławski | Punctually Standard and Non-standard Copies of Natural Numbers With Successor | ||
| John M. Hitchcock, Adewale Sekoni, Hadi Shafei | Counting Random Oracles for the Polynomial-Time Hierarchy and Quantum Complexity Classes | ||
| Volker Diekert | Quadratic Word Equations in Graph Products and the Exponent of Periodicity | ||
| B22 | Contributed Talks CiE | ||
| Federovici Silviu-Constantin | Idealisations Within Turing Computation: A Brouwerian Alternative | ||
| Lorenzo Carlucci and Oriola Gjetaj | Free Sets, Thin Sets and Rainbows for Barriers | ||
| Nathanael Ackerman, Cameron Freer, Mostafa Mirabi | Computable Cofinal Fraïssé Limits | ||
| 14.30-15.00 | A/B Mensa | Coffee Break | |
| 15.00-16.30 | HS 3 | Special Session VII | |
| New French Philosophy of Computing (HaPoC) | organized by Hajo Greif | ||
| HS 2 | Contributed Talks CiE | ||
| Giovanni Solda | On Some Computability Theoretic Aspects of Riemann Rearrangement Theorem | ||
| Gunnar Wilken | A Direct Method to Generalize Goodstein Principles | ||
| Duarte Maia | Escaping Tennenbaum's Theorem | ||
| B22 | Contributed Talks CiE | ||
| Lorenzo Carlucci, Giordano Celli | Weihrauch Reducibility Between Ramsey-type Theorems and Well-ordering Principles at the Level of Σ^0_2-Induction | ||
| Gian Marco Osso | The Laver Partition Theorem: The Nucleus of Ramsey Property and Determinacy? | ||
| (online) | Subin Pulari | On Normality and Equidistribution for Separator Enumerators | |
| 16.30 | HS 3 | Closing Address |
Registration and Financial Support
Registration fees: We distinguish between full registration and student registration.
- Full registration: Until June 30th: 200 €, from July 1st: 300 €.
- Student registration: Until June 30th: 150 €, from July 1st: 200 €.
Fees cover, among other things, local public transport, meals and coffee breaks at the university, access to rooms. These Fees apply to all conferences and workshops taking place in this week alike.
Funding opportunities for student members of the Association for Symbolic Logic (ASL) are available. Applications should be directed to the Association for Symbolic Logic three months prior to the meeting, following these instructions.
We are very happy to announce that within the framework of the Women in Computability program, we are able to offer some grants to cover the conference registration for junior women researchers who want to participate in CiE 2026. Applications for this grant should be sent to Johanna Franklin at johanna.n.franklinhofstraedu on or before 29 May 2026 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior women researchers who are presenting a paper (including informal presentations) at CiE 2026.
What to put into your calendar (AoE times)
- Abstract deadline: January 29th, 2026, submissions via Easychair.
- Full Paper deadline: February 3rd, 2026. We expect non-anonymous submissions up to 15 pages in LNCS format, including “everything” apart from a possible appendix (read at the discretion of the PC); alternatively, include a link to an ArXiv version.
- The second round of paper submissions had as deadline March 15th, 2026.
- Registration link opened: April 10th, 2026
- Notification: April 27th, 2026; the notifications have been sent out.
- Deadline for final papers: May 4th, 2026
- Deadline for submission of informal presentations (not to appear in the proceedings): May 17th, 2026 (a slight extension); submissions should be also done via Easychair.
- Notification on informal presentations: June 1st, 2026
Invited Speakers
- Olivier Bournez (Paris, France) [Tutorial Speaker]: Ordinary Differential Equations as a Universal Language for Computability and Complexity: From Polynomial Time to the Hyperarithmetical Hierarchy
- Georg Zetzsche (Kaiserslautern, Germany) [Tutorial Speaker]: General Decidability Results on Unboundedness Problems
- Albert Atserias (Barcelona, Spain): Circuit Complexity Theory in Models of Bounded Arithmetic
- Johanna Franklin (Hempstead, NY, USA): Highness for Scott Rank
- Mathieu Hoyrup (Nancy, France): Presentations of Topological Spaces
- Luca San Mauro (Bari, Italy): Left and Right Effective Symmetries on Baire and Cantor Space
- Francesca Zaffora Blando (Pittsburgh, USA): Algorithmic Randomness and Weak Merging of Opinions
Accepted Contributed Papers (included in the LNCS volume)
| Giulio Fellin, Sara Negri and Peter Schuster | Nuclear shifts for conservation |
| Arno Pauly | Mergeable represented spaces |
| Nathanael Ackerman, Cameron Freer and Mostafa Mirabi | Computable Cofinal Fraïssé Limits |
| Matthew de Brecht | A note on computable etale spaces |
| Florin Manea, Tina Ringleb, Stefan Siemer and Maximilian Winkler | Efficiently Finding All Shortest Absent Subsequences in a String |
| Mikhail Andreev and Alexander Shen | Bishop’s (up)crossing inequality and lower semicomputable random reals revisited |
| Sam Sanders and Dag Normann | On the computational properties of ambivalent sets and functions |
| Mario Grobler, Nils Morawietz and Silas Cato Sacher | Towards Settling the Complexity of the Lettericity Problem |
| Neil Lutz, Spencer Park Martin and Rain White | Lines in Every Direction with No ee-Random Points |
| Philip Janicki | Tadaki Numbers and Speedability |
| Subin Pulari | On Normality and Equidistribution for Separator Enumerators |
| Anton Lipin and Mikhail Volkov | Adversarial Synchronization and Reset Length |
| Makoto Fujiwara | On the Sigma-hierarchy of the logical principles over intuitionistic predicate logic |
| Ludwig Staiger. | A Polynomial-Time Algorithm for the Automatic Baire Property |
| Lorenzo Carlucci and Oriola Gjetaj | Free Sets, thin sets and Rainbows for barriers |
| John M. Hitchcock, Adewale Sekoni and Hadi Shafei | Counting Random Oracles for the Polynomial-Time Hierarchy and Quantum Complexity Classes |
| Merlin Carl | Complexity of Effective Reductions with Ordinal Turing Machines |
| Julianne Cruz, Sho Glashausser, Xiaoyuan Li and Neil Lutz | Adaptive Multi-Head Finite-State Gamblers |
| Aras Bacho, Svetlana Selivanova and Martin Ziegler | What is a POLYNOMIAL-TIME Computable Square-Integrable Function? |
| Katalin Anna Lázár, Florin Manea, Stefan Siemer and Timo Specht | Self-assembly of Strings and Languages Revisited: Efficient Membership Algorithms |
| Nikolay Bazhenov, Manat Mustafa and Stanislav Yun | On computability of ideal lattices |
| Riccardo Borsetto, Giulio Fellin, Tarmo Uustalu and Cheng-Syuan Wan | Glivenko’s theorem underneath structure |
| Eike Neumann and Margret Tembo | Termination of Real Linear Loops |
| Gero Ellmies and Till Fluschnik | Placing Green Bridges Optimally for Robust Habitat Reconnection |
| Peter Hertling and Leonard Schulte-Michels | Closure Properties of Left NP Real Numbers and NP Real Functions |
| Antonio Nakid Cordero and Isabella Scott | Comparing the Effective Content of Subshifts |
| Lorenzo Carlucci and Giordano Celli | Weihrauch reducibility between Ramsey-type theorems and well-ordering principles at the level of Σ^0_2-induction |
| Patrick Uftring | The more Gödels, the better |
| Sam Sanders | On the Reverse Mathematics of Darboux's supremum principle |
| Reino Niskanen, Igor Potapov and James Topley | Safety and Reachability in k-Control Games on Integer Vector Addition Systems with States |
Confirmed Informal Papers
- Yash Belani. Systematic Expansion of Robust Randomness Tests via AI-Assisted Implementation
- Volker Diekert. Quadratic word equations in graph products and the exponent of periodicity
- Luca Facchinetti. New results about reverse mathematics and wqo definitions
- Katalin Friedl, Levente Gegő, László Kabódi and Viktória Nemkin. Succinct QUBO formulations for permutation problems by sorting networks
- Ivan Georgiev. Characterization of Computable Irrationality
- Samuel German. Jump-Theoretic Boundaries for Explanatory Learning of Σ⁰₁-Definable Sets in Computable Equivalence Structures
- Fateme Ghasemi, W. F. Smyth and Jeffery Zucker. WhileCC-Approximability and Acceptability of Elementary Functions
- Valentina Harizanov and Keshav Srinivasan. Cohesive Powers of Function Structures
- Abhishek Krishnamoorthy, Robinson Thamburaj and Durairaj Gnanaraj Thomas. Combinatorial Properties of Christoffel and Stern–Brocot Trees with Applications to RSA
- Katalin Lazar, Florin Manea, Stefan Siemer and Timo Specht. Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure under Self-Assembly
- Steffen Lempp. The theory of the Ziegler degrees
- Duarte Maia. Escaping Tennenbaum's Theorem
- Gian Marco Osso. The Laver partition theorem: the nucleus of Ramsey property and determinacy?
- Igor Rystsov. Synchronizing Words on Product Automata
- Federovici Silviu-Constantin. Idealisations within Turing Computation: A Brouwerian Alternative
- Georgii Sirotenko and Ivan Titov. S2a-reducibility and differentiation in Martin-Löf random reals (see MCU)
- Giovanni Solda. On some computability theoretic aspects of Riemann rearrangement theorem
- Andrea Volpi. Reverse mathematics and dimension of posets
- Jan Philipp Wächter. Context-Free Trees
- Gunnar Wilken. A direct method to generalize Goodstein principles
- Michał Wrocławski. Punctually standard and non-standard copies of natural numbers with successor
Special Sessions of CiE 2026
Click on the Special Session titles to learn more ...
Groups and Computability (Laura Ciobanu & André Nies, MON / TUE)
Invited Speakers:
- Arman Darbinyan: The computability and geometry of the word problem in groups
- Turbo Ho: Word Problems and the Structure of Computably Enumerable Equivalence Relations
- Emmanuel Rauzy: Residual Properties of Groups in the Continuous Weihrauch Lattice
- Alex Thumm: Solving Equations in Groups
At the Borderline of Universality (Erzsébet Csuhaj-Varjú & Serghei Verlan, MON / TUE)
Invited Speakers:
- Artiom Alhazov: Busy Beaver Problem for Small Deterministic Register Machines
- Matthew Cook: Digit tiles: from Collatz sequences to pq-adic numbers
- Gemma De les Coves: Universality and Unreachability in Physics, Mathematics, Computer Science and Slightly Beyond
- Victor Mitrana: Multisets in Reaction Systems
Natural Computation and Bioinformatics (Karel Brinda & Giuditta Franco, MON / TUE)
Invited Speakers:
- Vincenzo Bonnici: Alignment-free Approaches in Genomic and Pangenomics
- Ragnar Groot Koerkamp: High Throughput Bioinformatics: Pairwise Alignment from Theory to Practice
- David Orellana Martín: Computing with Spikes and Membranes: Computability and Complexity in Spiking Neural P Systems
- Joanna Sułkowska: Novel Knotted Solenoid Fold with Order-Shifted Coil Arrangement
Quantum Computing and Information (Mika Hirvensalo, MON / TUE)
Invited Speakers:
- Jaroslaw Miszczak: Quantum Random Numbers and Where to Find Them
- Abuzer Yakaryilmaz: QIP ⊆ AM(2QCFA)
Learning Theory Meets Computability Theory (Cameron Freer & Sandra Zilles, THU / FRI)
Invited Speakers:
- Dana Fisman: Learning Omega-Regular Languages: A Tour of Learning Results and Canonical Representations
- Kevin Kelly: Topological Foundations for Inductive Learnability
- Alexander Kozachinskiy: Efficient Dimensions for Efficient Learning and Generation
- Ruth Urner: CPAC: A Brief Tale about a New Paradigm of Learnability
HaPoC (History and Philosophy of Computing): New French Philosophy of Computing (Hajo Greif, THU / FRI)
Invited Speakers:
- Thierry Coquand (will deliver an interview with Paula Quinon)
- Paula Quinon: The New French School of Philosophy of Computing
- Thomas Seiller: Mathematical Informatics: Algorithms
- Loïc Colson: An Introduction to Functional Systems
Program Committee of CiE 2026
- Verónica Becher, Universidad de Buenos Aires, Argentina
- Paola Bonizzoni,Università di Milano-Bicocca, Italy
- Vasco Brattka (PC co-chair), Universität der Bundeswehr Munich, Germany
- Rod Downey, Victoria University of Wellington, New Zealand
- Damir D. Dzhafarov, University of Connecticut, USA
- Henning Fernau (PC co-chair), Trier University, Germany
- Gilda Ferreira, Universidade Aberta, Portugal
- Lorenzo Galeotti (SC chair), University of Amsterdam, The Netherlands
- Daniel Graça, University of Algarve, Portugal
- Gabriel Istrate, University of Bucharest, Romania
- Jarkko Kari, University of Turku, Finland
- Lila Kari, University of Waterloo, Canada
- Akitoshi Kawamura,Kyoto University, Japan
- Takayuki Kihara, Nagoya University, Japan
- Alberto Marcone, Università di Udine, Italy
- Elvira Mayordomo, Universidad de Zaragoza, Spain
- Wolfgang Merkle, Universität Heidelberg, Germany
- Cécilia Pradic, Swansea University, UK
- Giuseppe Primero, University of Milan, Italy
- Paul Shafer, University of Leeds, UK
- Tomasz Steifer, Polish Academy of Sciences
- Frank Stephan, National University of Singapore
- Manlio Valenti, Swansea University, UK
- Serghei Verlan, University Paris Est Créteil, LACL, France
- Andreas Weiermann, Ghent University, Belgium
- Tomoyuki Yamakami, Fukui University, Japan
List of Topics of CiE 2026 (non-exclusive)
- Algorithmic Information Theory
- Algorithmic Learning Theory
- Algorithmic Measure Theory
- Algorithmic Randomness
- Analog Computation Models
- Automata Theory
- Biocomputing
- Category Theory
- Complexity Theory
- Complex Systems
- Computability
- Computable Analysis
- Computational Biology
- Decidability
- Descriptive Set Theory
- Formal Languages
- History of Computing
- Mathematical Logic
- Natural Computing
- Philosophy of Computation
- Proof Theory
- Quantum Computation
- Recursion Theory
- Reverse Mathematics
Responsible for the contents of this page: Henning Fernau.