Unconventional models of computation : third international conference, UMC 2002, Kobe, Japan, October 15-19, 2002 : proceedings
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
2509 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Unconventional models of computation, third international conference, UMC 2002, Kobe, Japan, October 15-19, 2002, proceedings, Cristian S. Calude, Michael J. Dinneen, Ferdinand Peper (eds.), Berlin, Springer, 2002, 1 vol. (VIII-329 p.), Lecture notes in computer science, 3-540-44311-8 • Unconventional Models of Computation, Texte imprimé, 9783662193754 |
جدول المحتويات:
- Invited 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.