Del 13419 - Lecture Notes in Computer Science

Machines, Computations, and Universality

9th International Conference, MCU 2022, Debrecen, Hungary, August 31 – September 2, 2022, Proceedings

Häftad, Engelska, 2022

AvJérôme Durand-Lose,György Vaszil,Jerome Durand-Lose,Gyorgy Vaszil

2 369 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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).

Produktinformation

Utgivningsdatum2022-08-07
Mått155 x 235 x 12 mm
Vikt318 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor189
FörlagSpringer International Publishing AG
ISBN9783031135019

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Programmeringsböcker inom Data och IT
Hårdvara inom Data och IT
Artificiell intelligens inom Data och IT

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.