000 03811nam a22006015i 4500
001 978-3-031-13502-6
003 DE-He213
005 20240423125417.0
007 cr nn 008mamaa
008 220806s2022 sz | s |||| 0|eng d
020 _a9783031135026
_9978-3-031-13502-6
024 7 _a10.1007/978-3-031-13502-6
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aMachines, Computations, and Universality
_h[electronic resource] :
_b9th International Conference, MCU 2022, Debrecen, Hungary, August 31 – September 2, 2022, Proceedings /
_cedited by Jérôme Durand-Lose, György Vaszil.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIV, 189 p. 32 illus., 12 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13419
505 0 _aComplexity 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.
520 _aThis 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).
650 0 _aAlgorithms.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 1 4 _aAlgorithms.
650 2 4 _aDesign and Analysis of Algorithms.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Engineering and Networks.
700 1 _aDurand-Lose, Jérôme.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aVaszil, György.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031135019
776 0 8 _iPrinted edition:
_z9783031135033
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13419
856 4 0 _uhttps://doi.org/10.1007/978-3-031-13502-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177627
_d177627