000 | 03831nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-45833-3 | ||
003 | DE-He213 | ||
005 | 20240423132506.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540458333 _9978-3-540-45833-3 |
||
024 | 7 |
_a10.1007/3-540-45833-6 _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 |
_aUnconventional Models of Computation _h[electronic resource] : _bThird International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings / _cedited by Cristian Calude, Michael J. Dinneen, F. Peper. |
250 | _a1st ed. 2002. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2002. |
|
300 |
_aIX, 329 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, _x1611-3349 ; _v2509 |
|
505 | 0 | _aInvited Papers -- The Complexity of Real Recursive Functions -- Hypercomputation in the Chinese Room -- Very Large Scale Spatial Computing -- The Minimum-Model DNA Computation on a Sequence of Probe Arrays -- An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution of HIV -- Halting of Quantum Turing Machines -- Filtrons of Automata -- A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction -- Contributed Papers -- Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations -- Implementing Bead-Sort with P Systems -- Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment -- Data Structure as Topological Spaces -- The Blob: A Basic Topological Concept for “Hardware-Free” Distributed Computation -- Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata -- Generation of Diophantine Sets by Computing P Systems with External Output -- An Analysis of Computational Efficiency of DNA Computing -- Communication and Computation by Quantum Games -- On the Power of Tissue P Systems Working in the Minimal Mode -- Reversible Computation in Asynchronous Cellular Automata -- General-Purpose Parallel Simulator for Quantum Computing -- Towards Additivity of Entanglement of Formation -- Membrane Computing: When Communication Is Enough -- Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata -- Relativistic Computers and Non-uniform Complexity Theory -- Quantum Optimization Problems -- An Analysis of Absorbing Times of Quantum Walks. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aBioinformatics. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aBioinformatics. |
700 | 1 |
_aCalude, Cristian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aDinneen, Michael J. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPeper, F. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540443117 |
776 | 0 | 8 |
_iPrinted edition: _z9783662193754 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2509 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45833-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188350 _d188350 |