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

Eviction

Incorporate

BATE

絕緣

The Minimum-Model DNA Computation on a Sequence of Probe Arraysdamental operations (separation by length and digestion) are dispensed with. To compensate for the loss, the probe arrays are considered as the media for reaction and a wash operation is added to the set of permissible operations. Computation in this model necessarily consists of cycles of five step

下級(jí)

An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution e on the n+1-th year, the variation between the above two sequences was analyzed by means of entropic chaos degree. The entropic chaos degree measures chaotic aspects of the dynamics causing the variation of sequence. If it is large, then the dynamics produces the large complexity, in other words, t

saturated-fat

Halting of Quantum Turing Machinesus from formulating the notion of computing on an arbitrary quantum Turing machine. Here, an argument is outlined to show that any QTM can be efficiently simulated by a QTM with well-behaved halting flag. Thus, we can affirmatively solve the halting problem for QTMs.

手勢(shì)

Filtrons of Automatascrete soliton-like objects were shown in a filter CA model that performs serial SP. Then, some other systems that support discrete solitons were proposed in nonlinear physics. Now there are iterated arrays, filter CAs, soliton CAs, higher order CAs, sequentially updated CAs, integrable CAs, IIR dig

mutineer

A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfactionve become an integral part of our world’s texture; in particular, they provide the “nervous system” for a variety of super- organisms among which and . we live..Paradoxically, even though computers were introduced by man, the tech nological, commercial, and social superhuman ‘a(chǎn)nimals’, thanks to the

intellect

Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computationsations to claim the difference in their space efficien- cies. It is shown that, for each ., there is a finite language . which contains sentences of length up to .(..) such that: . There is a one- way quantum finite automaton (qfa) of .(..) states which recognizes . However, if we try to simulate th

旅行路線