MCU explores computation in the setting of various discrete models (Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models, concurrent systems, etc.) and analog and hybrid models (BSS machines, infinite time cellular automata, real machines, quantum computing).

Complexity of Local, Global and Universality Properties in Finite Dynamical Systems.- A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors.- From Networks of Reaction Systems to Communicating Reaction Systems and Back.-  A Characterization of Polynomial Time Computable Functions from the Integers to the Reals using Discrete Ordinary Differential Equations.- Languages of Distributed Reaction Systems.- Prescribed Teams of Rules Working on Several Objects.-  PSPACE-Completeness of Reversible Deterministic Systems.-  From Finite Automata to Fractal Automata - the Power of Recursion.- Closure Properties of Subregular Languages under Operations.- P Systems with Evolutional Communication and Separation Rules.- Computational Universality and Efficiency in Morphogenetic Systems.- Adaptive Experiments for State Identification in Finite State Machines with Timeouts.