000 03492nam a22004935i 4500
001 978-3-540-74593-8
003 DE-He213
005 20170628034751.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540745938
_9978-3-540-74593-8
024 7 _a10.1007/978-3-540-74593-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aDurand-Lose, Jérôme.
_eeditor.
245 1 0 _aMachines, Computations, and Universality
_h[electronic resource] :
_b5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007. Proceedings /
_cedited by Jérôme Durand-Lose, Maurice Margenstern.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _aX, 328 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4664
505 0 _aInvited 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.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aMargenstern, Maurice.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540745921
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4664
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-74593-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c21414
_d21414