Titlebook: Unconventional Models of Computation; Third International Cristian Calude,Michael J. Dinneen,F. Peper Conference proceedings 2002 Springer

Cerumen

The Blob: A Basic Topological Concept for “Hardware-Free” Distributed Computationessary to represent data structure in a distributed “hardware-free” manner. Our solution is to encode a data structure as a system of color blobs, sharing relationships, and to ensure that these relationships are preserved during the evolution.

Tinea-Capitis

Microaneurysm

染色體

On the Power of Tissue P Systems Working in the Minimal Modeng in the minimal mode. We obtain two characterizations of recursively enumerable languages: . systems having 2 cells and 3 states as well as . systems having 4 cells and 2 states generate .. We also show that 2 cells and 2 states are sufficient for generating .0. languages, whereas 3 cells and 2 states are sufficient for generating .0. languages.

Contracture

Override

An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution throughout from the early stages of infection to death. That is, the variation patterns indicated that the entropic chaos degree is useful to measure the stage of disease progression after HIV-1 infection.

讓你明白

Implementing Bead-Sort with P Systemses) only. Beads are represented by . placed within . of a .; a rod is represented by a “group” of . that can communicate with one another by means of symport/antiport rules. The “flow” of objects between the group of membranes representing a rod (using communication rules) reflects the actual flow of beads in the physical system.

Friction

弄污

Communication and Computation by Quantum Gamesommunication and information carriers in quantum games. We also show that, quite surprisingly, communications in special quantum games can be used to solve problems that cannot be solved by using communications in classical games.

PALMY

The Complexity of Real Recursive Functionsticular, we prove both upper and lower bounds for several classes of real recursive functions, which lie inside the primitive recursive functions and, therefore, can be characterized in terms of standard computational complexity.