Go to main content

Machines, computations, and universality : 9th International Conference, MCU 2022, Debrecen, Hungary, August 31-September 2, 2022, proceedings / Jérôme Durand-Lose, György Vaszil (eds.).

International Conference on Machines, Computations, and Universality (9th : 2022 : Debrecen, Hungary); Durand-Lose, Jérôme, editor.; Vaszil, György, editor.
2022
QA75.5
Available Online
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket
Cite

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
Machines, computations, and universality : 9th International Conference, MCU 2022, Debrecen, Hungary, August 31-September 2, 2022, proceedings / Jérôme Durand-Lose, György Vaszil (eds.).
Meeting Name
International Conference on Machines, Computations, and Universality (9th : 2022 : Debrecen, Hungary)
ISBN
9783031135026 (electronic bk.)
3031135024 (electronic bk.)
9783031135019
3031135016
DOI
https://doi.org/10.1007/978-3-031-13502-6
Published
Cham, Switzerland : Springer, 2022.
Language
English
Description
1 online resource (1 volume) : illustrations (black and white).
Item Number
10.1007/978-3-031-13502-6 doi
Call Number
QA75.5
Dewey Decimal Classification
004
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).
Note
Includes author index.
Bibliography, etc. Note
References -- PSPACE-Completeness of Reversible Deterministic Systems -- 1 Introduction -- 2 The Framework -- 2.1 Required Gadgets -- 2.2 PSPACE-Hardness -- 3 Deterministic Constraint Logic -- 3.1 Issue with Existing Proof -- 3.2 PSPACE-Hardness -- 4 Billiard Balls -- References -- From Finite Automata to Fractal Automata - The Power of Recursion -- 1 Introduction -- 2 Basic Definitions -- 3 Regular Languages -- 4 The Context-Free Case -- 5 Properties of the Fractal Automata -- 6 Conclusions -- References -- Closure Properties of Subregular Languages Under Operations -- 1 Introduction
Access Note
Access limited to authorized users.
Source of Description
Description based on print version record.
Added Author
Durand-Lose, Jérôme, editor.
Vaszil, György, editor.
Series
Lecture notes in computer science ; 13419.
Available in Other Form
Machines, computations, and universality.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export