


default search action
3. UMC 2002: Kobe, Japan
- Cristian Calude, Michael J. Dinneen

, Ferdinand Peper:
Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings. Lecture Notes in Computer Science 2509, Springer 2002, ISBN 3-540-44311-8
Invited Papers
- Manuel Lameiras Campagnolo:

The Complexity of Real Recursive Functions. 1-14 - B. Jack Copeland:

Hypercomputation in the Chinese Room. 15-26 - André DeHon:

Very Large Scale Spatial Computing. 27-36 - Mitsunori Ogihara

, Animesh Ray
:
The Minimum-Model DNA Computation on a Sequence of Probe Arrays. 38-49 - Masanori Ohya:

An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution of HIV. 50-57 - Masanao Ozawa:

Halting of Quantum Turing Machines. 58-65 - Pawel Siwak:

Filtrons of Automata. 66-85 - Tommaso Toffoli:

A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction. 86-99
Contributed Papers
- Masami Amano, Kazuo Iwama, Raymond H. Putra:

Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations. 100-114 - Joshua J. Arulanandham:

Implementing Bead-Sort with P Systems. 115-125 - Carmen Graciani Díaz

, Francisco-Jesús Martín-Mateos, Mario J. Pérez-Jiménez:
Specification of Adleman's Restricted Model Using an Automated Reasoning System: Verification of Lipton's Experiment. 126-136 - Jean-Louis Giavitto

, Olivier Michel:
Data Structure as Topological Spaces. 137-150 - Frédéric Gruau, Philippe Malbos:

The Blob: A Basic Topological Concept for "Hardware-Free" Distributed Computation. 151-163 - Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita

:
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. 164-175 - Álvaro Romero Jiménez, Mario J. Pérez-Jiménez:

Generation of Diophantine Sets by Computing P Systems with External Output. 176-190 - Atsushi Kameda, Nobuo Matsuura, Masahito Yamamoto, Azuma Ohuchi:

An Analysis of Computational Efficiency of DNA Computing. 191-198 - Takeshi Kawakami:

Communication and Computation by Quantum Games. 199-207 - Shankara Narayanan Krishna, Raghavan Rama

:
On The Power of Tissue P Systems Working in the Minimal Mode. 208-219 - Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita

, Shinro Mashiko:
Reversible Computation in Asynchronous Cellular Automata. 220-229 - Jumpei Niwa, Keiji Matsumoto, Hiroshi Imai:

General-Purpose Parallel Simulator for Quantum Computing. 230-251 - Toshiyuki Shimono:

Towards Additivity of Entanglement of Formation. 252-263 - Petr Sosík

, Jirí Matýsek:
Membrane Computing: When Communication Is Enough. 264-275 - Hiroshi Umeo, Masaya Hisaoka, Koshi Michisaka, Koji Nishioka, Masashi Maeda:

Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata. 276-286 - Jirí Wiedermann

, Jan van Leeuwen
:
Relativistic Computers and Non-uniform Complexity Theory. 287-299 - Tomoyuki Yamakami:

Quantum Optimization Problems. 300-314 - Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:

An Analysis of Absorbing Times of Quantum Walks. 315-330

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














