9th Conference on Machines, Computations and Universality (MCU 2020)

Topics

• the search for frontiers between decidability and undecidability in the various models (for example, what is the smallest number of pairs of words for which the Post correspondence problem is undecidable, or what is the largest state-symbol product for which the halting problem is decidable for Turing machines, etc.);
• the search for the simplest universal models (such as small universal Turing machines, universal rewriting systems with few rules, universal cellular automata with small neighborhoods and a small number of states, etc.)
• how parallelism can be connected to decidability, complexity and universality;
• universality and undecidability in continuous models of computation.