Machines, Computations, and Universality : 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 – September 2, 2022, Proceedings / edited by Jérôme Durand-Lose, György Vaszil.

Format:

Book

Contributor:

Vaszil, György, editor.

Durand-Lose, Jérôme, editor.

Series:

Lecture Notes in Computer Science, 1611-3349 ; 13419

Language:

English

Subjects (All):

Algorithms.

Artificial intelligence.

Software engineering.

Computer engineering.

Computer networks.

Design and Analysis of Algorithms.

Artificial Intelligence.

Software Engineering.

Computer Engineering and Networks.

Local Subjects:

Algorithms.

Design and Analysis of Algorithms.

Artificial Intelligence.

Software Engineering.

Computer Engineering and Networks.

Physical Description:

1 online resource (203 pages)

Edition:

1st ed. 2022.

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2022.

Summary:

This book constitutes the refereed proceedings of the 9th International Conference on Machines, Computations, and Universality, MCU 2022, held in Debrecen, Hungary, in August/September 2022. The 10 revised full papers presented were carefully reviewed and selected from 18 submissions. 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).

Contents:

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.

Notes:

Includes bibliographical references and index.

Other Format:

Print version: Durand-Lose, Jérôme Machines, Computations, and Universality

ISBN:

3-031-13502-4