: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
The Hausdorff distance between two sets of curves is a measure for the similarity of these objects and therefore an interesting feature in shape recognition. If the curves are alg...
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
in HTML. Full version in PDF. 08i YOGEV, O., SHAPIRO, A. A., AND ANTONSSON, E. K. Computational Evolutionary Embryogeny. IEEE Transactions on Evolutionary Computation. Accepted for...