UMC 2002

Front Cover
Springer Science & Business Media, Sep 30, 2002 - Computers - 329 pages
The Third International Conference onUnconventional Models of C- putation, UMC2002 was organized by the Center for Discrete Mathematics andTheoreticalComputerScienceandtheKansaiAdvancedResearchCenterof the Communications Research Laboratory, Kansai, Japan. The venue was held in the "unconventional" multipurpose Orbis Hall from 15 to 19 October 2002. Being part of the Kobe Fashion Museum, a disk-shaped building in the center of Kobe's Rokko Island, the Hall is conveniently located near the Hotel Plaza Kobe and the Kobe Bay Sheraton hotel. Various natural processes motivate the construction of radically new models of computation. For example, the paper "Not Just a Pretty Face" published in the July 27, 2002 issue ofNewScientist discusses the hypothesis that plants mayhavethepowertocomputewithoutthebene?tofabrain. Thispromptsthe question of what sort of computation capability and complexity human bodies may be capable of, even without the help of the nervous system. Although th- ving, the realization of powerful unconventional models of computing is still at an early stage in its development, and a huge and concerted e?ort is required to assess and exploit its real potential. This volume reports the main ideas, results, directions of research, and open questions, discussed at a highly intellectual g- hering of leaders in this new ?eld of research. The ?ow of discussion varies from theoretical aspects to practical implementations and philosophical re?ection. Theeightinvitedspeakersattheconferencewere: M. L. Campagnolo(Lisbon, Portugal), J. Copeland (Canterbury, New Zealand), A. DeHon (CalTech, USA), M. Ogihara (Rochester, USA), M. Ohya (Japan), M. Ozawa (Tohoku, Japan), P. Siwak (Poznan, Poland), and T. To?oli (Boston, USA). TheProgramCommittee, consistingofL. Accardi(Roma, Italy), C. S.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

The Complexity of Real Recursive Functions
1
Hypercomputation in the Chinese Room
15
Very Large Scale Spatial Computing
27
The MinimumModel DNA Computation on a Sequence of Probe Arrays
38
An Application to the Evolution of HIV
50
Halting of Quantum Turing Machines
58
Filtrons of Automata
66
An Issue of Adaptive Fitness and Personal Satisfaction
86
Generation of Diophantine Sets by Computing P Systems with External Output
176
An Analysis of Computational Efficiency of DNA Computing
191
Communication and Computation by Quantum Games
199
On The Power of Tissue P Systems Working in the Minimal Mode
208
Reversible Computation in Asynchronous Cellular Automata
220
GeneralPurpose Parallel Simulator for Quantum Computing
230
Towards Additivity of Entanglement of Formation
252
When Communication Is Enough
264

Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
100
Implementing BeadSort with P Systems
115
Verification of Liptons Experiment
126
Data Structure as Topological Spaces
137
A Basic Topological Concept for HardwareFree Distributed Computation
151
Embedding a Logically Universal Model and a SelfReproducing Model into NumberConserving Cellular Automata
164
Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata
276
Relativistic Computers and Nonuniform Complexity Theory
287
Quantum Optimization Problems
300
An Analysis of Absorbing Times of Quantum Walks
315
Author Index
330
Copyright

Other editions - View all

Common terms and phrases