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

companion

Carbon-Monoxide

nonradioactive

https://doi.org/10.1007/3-540-45833-6Cellular Computing; Computer; Computing Theory; DNA Computing; Hardware; Mebrane Computing; Molecular Comp

Mast-Cell

Cristian Calude,Michael J. Dinneen,F. PeperIncludes supplementary material:

parallelism

Vulvodynia

tooth-decay

敲詐

無(wú)禮回復(fù)

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.

cogent

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 diophantine set.