Titlebook: Unconventional Computation; 7th International Co Cristian S. Calude,José Félix Costa,Grzegorz Rozen Conference proceedings 2008 The Editor(

Malfunction

tenuous

步履蹣跚

消息靈通

septicemia

On the Computational Complexity of Spiking Neural P Systemsspiking neural P systems considered here have a constant number of neurons that is independent of the input length. Following this we construct a universal spiking neural P system with exhaustive use of rules that simulates Turing machines in polynomial time and has only 18 neurons.

精美食品

Self-assembly of Decidable Sets “wedge construction”) that is capable of universal computation. We then extend the wedge construction to prove the following result: if a set of natural numbers is decidable, then it and its complement’s canonical two-dimensional representation self-assemble. This leads to a novel characterization

發(fā)酵

埋葬

olfction

Conference proceedings 2008 August 2008. The 16 revised full papers presented together with 4 invited papers were carefully reviewed and selected for inclusion in the book. The papers are devoted to all aspects of unconventional computation ranging from theoretical and experimental aspects to various applications. Typical top

expository

Oracles and Advice as Measurementsfeasible computations by Turing machines interacting with an oracle in Nature, and that by classifying the information content of such a natural oracle, using Kolmogorov complexity, we obtain a hierarchical structure based on measurements, advice classes and information.