Machines, Computations, and Universality 5th International Conference, MCU 2007, Orleans, France, September 10-13, 2007, Proceedings
-
- Taschenbuch ausgewählt
- eBook
-
Sprache:Englisch
-
Verlag:Springer Berlin
- Springer Fr. 72.90
- Springer Berlin Fr. 72.90 ausgewählt
-
Auflage:2007
- 2007 Fr. 72.90 ausgewählt
- 2005 Fr. 72.90
- 2001 Fr. 72.90
Fr. 72.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
23.08.2007
Abbildungen
X, 328 p.
Herausgeber
Jérôme Durand-Lose + weitereVerlag
Springer BerlinSeitenzahl
328
Maße (L/B/H)
23.5/15.5/1.9 cm
Gewicht
517 g
Auflage
2007
Sprache
Englisch
ISBN
978-3-540-74592-1
Invited Talks.- Encapsulating Reaction-Diffusion Computers.- On the Computational Capabilities of Several Models.- Universality, Reducibility, and Completeness.- Using Approximation to Relate Computational Classes over the Reals.- A Survey of Infinite Time Turing Machines.- The Tiling Problem Revisited (Extended Abstract).- Decision Versus Evaluation in Algebraic Complexity.- A Universal Reversible Turing Machine.- P Systems and Picture Languages.- Regular Papers.- Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.- Uniform Solution of QSAT Using Polarizationless Active Membranes.- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.- Planar Trivalent Network Computation.- On the Power of Networks of Evolutionary Processors.- Study of Limits of Solvability in Tag Systems.- Query Completeness of Skolem Machine Computations.- More on the Size of Higman-Haines Sets: Effective Constructions.- Insertion-Deletion Systems with One-Sided Contexts.- Accepting Networks of Splicing Processors with Filtered Connections.- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.- Four Small Universal Turing Machines.- Changing the Neighborhood of Cellular Automata.- A Simple P-Complete Problem and Its Representations by Language Equations.- Slightly Beyond Turing's Computability for Studying Genetic Programming.- A Smallest Five-State Solution to the Firing Squad Synchronization Problem.- Small Semi-weakly Universal Turing Machines.- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.