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

不幸的人

A Computational Journey into Nonlinearityy always in a state of becoming. In the process, some meta-principles emerge which guide the autonomous evolution of mathematical computation. These organic principles are essential keys to analyze very large numerical simulations of unstable phenomena: they lie at the heart of the new theory of Qualitative Computing.

Regurgitation

dapper

细颈瓶

Majority Adder Implementation by Competing Patterns in Life-Like Rule ,2/,2345f patterns — symmetric (.) and asymmetric (.). We construct basic logical gates and elementary arithmetical circuits by simulating logical signals using glider reactions taking place in the channels built of non-destructible still lifes. We design a binary adder of majority gates realised in rule .2/.2345.

Optimum

Quantum Computation with Devices Whose Contents Are Never Readter with a WOM nor a quantum computer without a WOM can solve, when all other resource bounds are equal. We also show that resource-bounded quantum reductions among computational problems are more powerful than their classical counterparts.

轻信

Subjugate

A New Representation of Chaitin Ω Number Based on Compressible Stringsheir properties. In particular, we show that the computability of the real Θ(.) gives a sufficient condition for a real . ∈ (0,1) to be a fixed point on partial randomness, i.e., to satisfy the condition that the compression rate of . equals to ..

HEAVY

记忆法

reperfusion

The Extended Glider-Eater Machine in the Spiral Rule Since the counter can be understood as a part of the Minsky register machine with only the INC (increment) function implemented, we envisage that the extended glider-eater machine could be essential if one intends to build a complete Minsky register machine in the Spiral Rule and to prove the rule is Turing-universal.