Titlebook: Unconventional Computation; 4th International Co Cristian S. Calude,Michael J. Dinneen,Grzegorz Roz Conference proceedings 2005 Springer-Ve

發(fā)展

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/u/image/941193.jpg

新陳代謝

https://doi.org/10.1007/11560319Computer; DNA computing; algorithm; algorithms; amorphous computing; automata; autopoietic automata; cellul

Mucosa

On Formulations of Firing Squad Synchronization Problems state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulation is more suited for the general theory of the firing squad synchronization problem.

Incompetent

A New Sibling of BQPial-time computable functions and a unitarity condition. It contains both Deutsch-Jozsa’s and Shor’s algorithm, while it’s relation to BQP is unknown. This shows that in the complexity class hierarchy, BQP is not an extraordinary isolated island, but has ”siblings” which as well can solve prime-factorization.

重力

AORTA

Chemotherapy

ASTER

Quantum Searching Amidst Uncertaintythms for this problem could also only lower the probability of error to .( ..). Using a recently invented quantum search technique, this paper gives an algorithm that reduces the probability of error to .(..). The algorithm is asymptotically optimal.

Delirium

On Self-assembly in Population P Systemshen, we precisely state the problem of programmable self-assembly for P systems as the problem of uniquely generating a given graph by means of self-assembly P systems. In this respect, we show how to define a self-assembly P systems that uniquely generates a complete binary tree by using a “minimal” set of resources.

妨礙

On Model-Checking of P Systemsify what is decidable (or undecidable) about model-checking these systems under extended logic formalisms of CTL. We also report on some experiments on whether existing conservative (symbolic) model-checking techniques can be practically applied to handle P systems with a reasonable size.