Machines, Computations, and Universality
Springer Berlin (Verlag)
978-3-540-74592-1 (ISBN)
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.
| Erscheint lt. Verlag | 23.8.2007 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | X, 328 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 516 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Informatik ► Weitere Themen ► Hardware | |
| Schlagworte | Automat • Automata • BSS machines • Cellular Automata • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • infinite cellular automata • molecular computations • Neural networks • other automata • Quantum Computing • real machines • register machines • tiling of the plane • Turing Machines • Word Processing |
| ISBN-10 | 3-540-74592-0 / 3540745920 |
| ISBN-13 | 978-3-540-74592-1 / 9783540745921 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
