000 03698nam a22005415i 4500
001 978-3-540-31834-7
003 DE-He213
005 20240730185506.0
007 cr nn 008mamaa
008 100702s2005 gw | s |||| 0|eng d
020 _a9783540318347
_9978-3-540-31834-7
024 7 _a10.1007/b106980
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aMachines, Computations, and Universality
_h[electronic resource] :
_b4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers /
_cedited by Maurice Margenstern.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aVIII, 328 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3354
505 0 _aInvited Lectures -- Algorithmic Randomness, Quantum Physics, and Incompleteness -- On the Complexity of Universal Programs -- Finite Sets of Words and Computing -- Universality and Cellular Automata -- Leaf Language Classes -- Selected Contributions -- Computational Completeness of P Systems with Active Membranes and Two Polarizations -- Computing with a Distributed Reaction-Diffusion Model -- Computational Universality in Symbolic Dynamical Systems -- Real Recursive Functions and Real Extensions of Recursive Functions -- Ordering and Convex Polyominoes -- Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages -- Evolution and Observation: A Non-standard Way to Accept Formal Languages -- The Computational Power of Continuous Dynamic Systems -- Abstract Geometrical Computation for Black Hole Computation -- Is Bosco's Rule Universal? -- Sequential P Systems with Unit Rules and Energy Assigned to Membranes -- Hierarchies of DLOGTIME-Uniform Circuits -- Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays -- Register Complexity of LOOP-, WHILE-, and GOTO-Programs -- Classification and Universality of Reversible Logic Elements with One-Bit Memory -- Universal Families of Reversible P Systems -- Solving 3CNF-SAT and HPP in Linear Time Using WWW -- Completing a Code in a Regular Submonoid of the Free Monoid -- On Computational Universality in Language Equations -- Attacking the Common Algorithmic Problem by Recognizer P Systems -- On the Minimal Automaton of the Shuffle of Words and Araucarias.
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9139538
650 0 _aAlgorithms.
_93390
650 1 4 _aTheory of Computation.
_9139539
650 2 4 _aFormal Languages and Automata Theory.
_9139540
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aAlgorithms.
_93390
700 1 _aMargenstern, Maurice.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9139541
710 2 _aSpringerLink (Online service)
_9139542
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540252610
776 0 8 _iPrinted edition:
_z9783540808732
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3354
_9139543
856 4 0 _uhttps://doi.org/10.1007/b106980
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92855
_d92855