The International conference series MCU traces its roots back to the mid 1990's, and has always been concerned with gaining a deeper understanding of computation and universality through the study of models of general purpose computation. Last edition took place in Debrecen, Hungary (2022). The before last edition was canceled because of COVID-19 pandemic (2020).

Aims and scope

The scope of the conference topics includes, but is not limited to, computation in the setting of various discrete models (Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models...), analog and hybrid models (BSS machines, infinite time cellular automata, real machines, quantum computing...) and the meaning and implantation of universality in these contexts. Particular emphasis is given towards search for frontiers between decidability and undecidability in the various models, search for the simplest universal models, computational complexity of predicting the evolution of computations in the various models. Parallel computing models and their connections to decidability, complexity and universality.
Topics of interest include, but are not limited to:
   - Analog computation
   - Automata theory
   - Cellular automata
   - Classical computability and degree structures
   - Computability theoretic aspects of programs
   - Computable analysis and real computation
   - Computable structures and models
   - Continuous computing
   - Decidability of theories
   - DNA computing, self-assembly and tiling
   - Dynamical systems and computational models
   - Emerging and non-standard models of computation
   - Finite model theory
   - Generalized recursion theory
   - Higher type computability
   - Hyper-computational models
   - Infinite time Turing machines
   - Membrane computing
   - Molecular computation
   - Morphogenesis and developmental biology
   - Multi-agent systems
   - Natural computation and Hybrid systems
   - Neural nets and connectionist models
   - Physics and computability
   - Proof theory and computability
   - Randomness and Kolmogorov complexity
   - Relativistic computation
   - Swarm intelligence and self-organisation
   - Theory of Petri nets
   - Turing, Counter, Register, Signal machines
   - Universality of systems

Anti-harassment policy

We believe that the advancement of research is best accomplished in an environment that is open, diverse and respectful to all participants. During the conference, we will follow the anti-harassment policy of ACM. Anyone witnessing or subject to unacceptable behaviour should notify the conference chairs.