Unconventional Computation and Natural Computation

Name: Unconventional Computation and Natural Computation | 17th International Conference, UCNC 2018, Fontainebleau, France, June 25-29, 2018, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

17th International Conference, UCNC 2018, Fontainebleau, France, June 25-29, 2018, Proceedings

Susan Stepney Sergey Verlan(Editor)

Springer (Publisher)

Published on 14. June 2018

XVIII, 217 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-92435-9 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Abstracts of Invited Talks
Exploring Computation in Chemical Systems With Programmable Chemical Arrays
The Alchemy of Computation: How to Use the Unknown
Molecular Robotics Project
Molecular Computation with DNA Self-assembly
Contents
P Systems with Activation and Blocking of Rules
1 Introduction
2 Definitions
2.1 Preliminaries
2.2 Register Machines
2.3 A General Model for Hierarchical P Systems
3 P Systems with Activation and Blocking of Rules
4 Results Below PsRE
5 Computational Completeness Results
5.1 Sequential P Systems with Non-cooperative Rules
5.2 P Systems Working in the smax-Mode
5.3 (Purely) Catalytic P Systems Working in the max-Mode
6 P Systems Using Backwards Activation and Blocking of Rules
7 Going Beyond Turing
8 Conclusion
References
Thermodynamically Favorable Computation via Tile Self-assembly
1 Introduction
2 Preliminaries
2.1 TBN Model
2.2 Zig-Zag Simulation of Turing Machines
3 Simulating Space-Bounded Turing Machines
3.1 Overview of the Proof of Theorem1
4 Simulation of Arbitrary Boolean Circuits via TBN Without a Tile Assembly Pathway
5 A Negative Result on Porting Computing Systems from the aTAM to the TBN Model
6 Geometric Thermodynamic Binding Networks
6.1 GTBN Model Definition
6.2 Efficient Simulation of Turing Machines in GTBNs
References
Optimal Staged Self-assembly of Linear Assemblies
1 Introduction
2 The Staged Self-assembly Model
3 Assembling 1n Lines
3.1 Lower Bound
4 Assembling O(1) n Lines
4.1 Special Class of O(1) n Lines
4.2 Generalizing to All n
4.3 Lower Bounds for O(1) n Lines
5 Assembling O(1) n Line Sets
6 Assembling Hefty Shapes
References
The Scope of a Relativistic Quantum Process with Spin-Momentum Entanglement
1 Introduction
2 Wigner Angles in Relativity
3 The Reduced Density Matrix in Relativity
4 Quantum Information in Relativity
5 Conclusion
References
Mechanical Sequential Counting with Liquid Marbles
1 Introduction
1.1 Liquid Marbles
1.2 Existing Computational Techniques with Liquid Marbles
2 Liquid Marbles for Mechanical Counting
2.1 Mechanical Flip-Flop Gates
2.2 Liquid Marble Actuated Mechanical Counter
2.3 Speed-Bumps in the Design Process
2.4 Materials and Design
3 Conclusions and Future Work
References
Word Blending in Formal Languages: The Brangelina Effect
1 Introduction
2 Preliminaries
3 Closure Properties
4 Decision Problems
5 State Complexity
References
Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems
1 Introduction
2 Preliminaries
3 Main Results
4 Conclusion and Future Work
References
An FPGA Implementation of a Distributed Virtual Machine
1 Introduction
1.1 Emulation of SIMD by MIMD
1.2 Emulation of SISD by MIMD
1.3 Robust Evaluation of Expressions
2 Virtual Machine
3 Distributed Virtual Machine
4 Four Implementation Models
4.1 Shared Memory Multiprocessor
4.2 Distributed Memory Multicomputer
4.3 Movable Feast Machine
4.4 Field Programmable Gate Array
5 Technical Details
6 Experimental Results
7 Conclusion
References
Algorithms for Inferring Context-Sensitive L-Systems
1 Introduction
2 Preliminaries
3 Inferring L-Systems
3.1 Deterministic Context-Free L-Systems
3.2 Deterministic Context-Sensitive L-Systems
4 Speedups Using Letter Occurrence Arithmetic
4.1 Context-Free Case
4.2 Context-Sensitive Case
5 Conclusions and Future Directions
References
Reaction Mining for Reaction Systems
1 Preliminaries
2 Parametric Reaction Systems
3 smt-Based Encoding
4 Experimental Evaluation
5 Concluding Remarks
References
Analyzing Execution Time of Card-Based Protocols
1 Introduction
2 Preliminaries: A Protocol with Operations
3 New Metrics and Execution Time of Protocols
3.1 Operations to Consider
3.2 Analysis of the Number of Operations in Each Protocol
3.3 Execution Time of Protocols
4 Comparison of the Protocols
4.1 Efficiency Comparison Based on the Execution Time
4.2 Impact of the Execution Time of Shuffling
5 Conclusion
References
Algorithmic Design of Cotranscriptionally Folding 2D RNA Origami Structures
1 Introduction
2 RNA Tiles, Cotranscriptional Folding and Polymerase Trapping
3 Tiles, Grids and Spanning Trees
4 Search Algorithm
5 Design Pipeline and Examples
6 Conclusions and Future Work
References
Deterministic Sensing 5'3' Watson-Crick Automata Without Sensing Parameter
1 Introduction
2 Definitions, Preliminaries
3 Results on Deterministic Sensing 5' 3' WK Automata
3.1 Proper Hierarchy Results
3.2 Incomparability Results
3.3 Some Equivalent Classes (To 2detLIN)
4 Conclusions
References
Collaborative Computation in Self-organizing Particle Systems
1 Introduction
1.1 Amoebot Model
1.2 Related Work
1.3 Our Contributions
2 Preliminaries
3 Binary Particle Counter Algorithm
3.1 Runtime Analysis
4 Particle Matrix Multiplication Algorithm
4.1 The Algorithm
4.2 Correctness and Runtime Analysis
5 Image Processing Applications
6 Simulation Results
7 Discussion
References
Phase Transitions in Swarm Optimization Algorithms
1 Introduction
2 Theoretical Background
2.1 Swarm Based Optimization
2.2 Lemplel-Ziv Complexity
2.3 Recurrence Quantification Analysis
3 Experiment Design
4 Results
4.1 ANOVA Testing
5 Discussion
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Unconventional Computation and Natural Computation

Description

More details

Other editions

Additional editions

Content

System requirements