Titlebook: Unconventional Computation; 9th International Co Cristian S. Calude,Masami Hagiya,Jon Timmis Conference proceedings 2010 Springer-Verlag Be

禁止

惊惶

The Extended Glider-Eater Machine in the Spiral Rulehe complete state transition table of such interactions, with which one can build the extended glider-eater machine composed of multiple instances of gliders and eaters to compute in specific problems. We demonstrate the implementation of asynchronous counters with the extended glider-eater machine.

disciplined

啮齿动物

粗俗人

Algebras and Languages for Molecular Programmingly, some very simple computational schemes have been developed that are autonomous (run on their own once started) and involve only short (easily synthesizable) DNA strands with no other complex molecules.

AWRY

Finite State Transducers with Intuition can serve as a help-word. Finite automata with such help can recognize languages not recognizable by nondeterministic nor probabilistic automata. We hope that mechanisms like the one considered in this paper may be useful to construct a mathematical model for human intuition.

affinity

Characterising Enzymes for Information Processing: Towards an Artificial Experimentere small number of observations practicable. Coupling this approach with a lab-on-chip platform currently in development, we seek to create an autonomous experimentation machine capable of enzyme characterisation, which can be used as a tool for developing enzymatic computing.

CT-angiography

Solving Partial Differential Equation via Stochastic Processutation, one may say that the stochastic process can solve the partial differential equation. An algebraic method to derive dual processes is explained, and two examples of partial differential equations are shown.

GILD

Postselection Finite Quantum Automatairst we prove by a direct construction that the complement of this language can be recognized this way. This result distinguishes quantum automata from probabilistic automata because probabilistic finite automata with non-isolated cut-point 0 can recognize only regular languages but PALINDROMES is not a regular language.

揭穿真相

Quantum Query Algorithms for Conjunctionsind of an algorithm for conjunction of two bits, that has a correct answer probability . = 9/10. This algorithm improves success probability by 10%, but stands aside and cannot be extended to compute conjunction of Boolean functions.