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

比目鱼

Certainty

Data Structure as Topological Spacesary computations along this path. This idea underlies an experimental declarative programming language called .. . introduces the notion of .: a set of values organized by a neighborhood relationship. The basic computation step in . relies on the notion of .: a path . is substituted for a path . in

充气女

Tempor

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Amber of its configuration is conserved through- out its computing process. It can be thought as a kind of modelization of the physical conservation law of mass or energy. Although NCCAs with simple rules are studied widely, it is quite difficult to design NCCAs with complex transition rules. We show

fixed-joint

Generation of Diophantine Sets by Computing P Systems with External Outputder composition and iteration of functions. We prove that every diophantine set can be generated by such P systems; then, the universality of this model can be deduced from the theorem by Matiyasevich, Robinson, Davis and Putnam in which they establish that every recursively enumerable set is a diop

monopoly

持续

Communication and Computation by Quantum Gamescision without knowing the decision of the opponent. Prisoners tell their jailer as their arbitrator their decisions and the jailer gives each of the prisoners an appropriate payoff according to the pay- off function (the payoff table). That is, a certain communication between the two prisoners is p

妈妈不开心

On the Power of Tissue P Systems Working in the Minimal Modems working in the minimal mode. All the results in this paper are solutions to some of the open problems listed in [.] with respect to . systems working in the minimal mode. We obtain two characterizations of recursively enumerable languages: . systems having 2 cells and 3 states as well as . system

Cursory

明确