You have Guest access.
Log In
Jérôme Durand-Lose and Maurice Margenstern
Front matter
1-11
Encapsulating Reaction-Diffusion Computers
12-23
On the Computational Capabilities of Several Models
24-38
Universality, Reducibility, and Completeness
39-61
Using Approximation to Relate Computational Classes over the Reals
62-71
A Survey of Infinite Time Turing Machines
72-79
The Tiling Problem Revisited (Extended Abstract)
80-89
Decision Versus Evaluation in Algebraic Complexity
90-98
A Universal Reversible Turing Machine
99-109
P Systems and Picture Languages
110-121
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
122-133
Uniform Solution of QSAT Using Polarizationless Active Membranes
134-145
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
146-157
Planar Trivalent Network Computation
158-169
On the Power of Networks of Evolutionary Processors
170-181
Study of Limits of Solvability in Tag Systems
182-192
Query Completeness of Skolem Machine Computations
193-204
More on the Size of Higman-Haines Sets: Effective Constructions
205-217
Insertion-Deletion Systems with One-Sided Contexts
218-229
Accepting Networks of Splicing Processors with Filtered Connections
230-241
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
242-254
Four Small Universal Turing Machines
255-266
Changing the Neighborhood of Cellular Automata
267-278
A Simple P-Complete Problem and Its Representations by Language Equations
279-290
Slightly Beyond Turing’s Computability for Studying Genetic Programming
291-302
A Smallest Five-State Solution to the Firing Squad Synchronization Problem
303-315
Small Semi-weakly Universal Turing Machines
316-324
Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4 n -Steps Solution
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info