Central Library

Normal view MARC view ISBD view

Machines, Computations, and Universality [electronic resource] : 5th International Conference, MCU 2007, Orleans, France, September 10-13, 2007, Proceedings / edited by Jérôme Durand-Lose, Maurice Margenstern.

Contributor(s): Durand-Lose, Jérôme [editor.] | Margenstern, Maurice [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 4664Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: X, 328 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540745938.Subject(s): Computer science | Computers | Computer programming | Machine theory | Theory of Computation | Computer Hardware | Programming Techniques | Formal Languages and Automata Theory | Computer Science Logic and Foundations of ProgrammingAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.