|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-31834-7 |
| 003 |
DE-He213 |
| 005 |
20230222022221.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100702s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540318347
|9 978-3-540-31834-7
|
| 024 |
7 |
|
|a 10.1007/b106980
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM037000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Machines, Computations, and Universality
|h [electronic resource] :
|b 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers /
|c edited by Maurice Margenstern.
|
| 250 |
|
|
|a 1st ed. 2005.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2005.
|
| 300 |
|
|
|a VIII, 328 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3354
|
| 505 |
0 |
|
|a Invited 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
|
|a Margenstern, Maurice.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540808732
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540252610
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3354
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/b106980
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
