Tag Archives: Natural Computing

Abstract  We consider stateless counter machines which mix the features of one-head counter machines and special two-head Watson–Crick
automata (WK-automata). These biologically motivated machines have heads that read the input starting fr… Continue reading →

Abstract  The Deutsch–Jozsa problem is one of the most basic ways to demonstrate the power of quantum computation. Consider a Boolean
function f : {0, 1}
n
→ {0, 1} and suppose we have a black-box to compute f. The Deutsch Continue reading →

Abstract  In classical computation, a “write-only memory” (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic
or probabilistic) classical computer brings no advantage. We prove that quantum computers that a… Continue reading →

Abstract  It is generally assumed that supertasks increase computational power. It is argued, for example, that supertask machines can
compute beyond the Turing limit, e.g., compute the halting function. We challenge this assumption. We do n… Continue reading →

Abstract  P systems (PSs) are powerful computing models based on the structure of a biological cell and on the way chemicals interact
in complex biochemical reactions which take place in various compartments (or membranes) of the cell. A lot… Continue reading →

Abstract  In 1975 Chaitin introduced his

\Upomega

number as a concrete example of random real. The real

\Upomega

is defined based on the set of all halting inputs for an optimal prefix-free machine U, which is a univer… Continue reading →

Abstract  Amorphous computing presents a novel computational paradigm. The respective computational models have been recently introduced
and studied in a series of works by J. Wiedermann and his Ph.D. student L. Petrů. From a computational … Continue reading →

Abstract  Proving that a dynamical system is chaotic is a central problem in chaos theory (Hirsch in Chaos, fractals and dynamics, 1985]. In this note we apply the computational method developed in (Calude and Calude in Complex Syst 18:267–… Continue reading →

Abstract  The first half of this paper is the written version of the invited talk presented at Unconventional Computing UC10, The University
of Tokyo, Japan, June 21–25, 2010. It describes some salient features of hypercomputation in Dicks… Continue reading →

Abstract  The Topological Active Volumes is an active model focused on 3D segmentation tasks. It is based on the 2D Topological Active
Nets model and provides information about the surfaces and the inside of the detected objects in the scene… Continue reading →