PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bolognesi T. Behavioral complexity indicators for process algebra: the NKS approach. In: Journal of Logic and Algebraic Programming, vol. 72 (1) pp. 50 - 77. Algebraic Process Calculi: The First Twenty Five Years and Beyond. II. Elsevier, 2007.
 
 
Abstract
(English)
Several techniques for the experimental investigation of the computing power of various formal models, from cellular automata to Turing machines, have been proposed by S.Wolfram with his NKS (New Kind of Science). Visual complexity indicators reveal the 'internal shapes' of computations, and may expose constant, periodic, nested/fractal, pseudo-random, and even more sophisticated dynamics. In this paper we investigate visual complexity indicators for process algebra. With its emphasis on reactive, continuously observable behavior, as opposed to input/output behavior, process algebra might appear as an ideal candidate for NKS-style investigations; however, this formal model is in some sense more elaborate than the simple formalisms addressed in NKS, and poses specific problems, such as the presence of both events and states, and the explosive nature of non-determinism. We consider a set of process algebraic operators and prove its Turing universality by showing that they can emulate any elementary cellular automaton, including n. 110, which is itself universal. The correctness of the emulation is supported by an original visual indicator, which is then used for exploring various subclasses of algebraic expressions and their emergent features. Based on this indicator, and even by restricting to deterministic computations, we have detected and measured, by a data compression technique, the emergence of randomness in a subclass of expressions which is provably not universal. Besides providing a suggestive visualization of the relative strengths of operator subsets, we believe that results of this type, both of theoretical and of experimental nature, are desirable in light of one of the key NKS conjectures, according to which random-like behavior would be a witness of computational universality.
URL: http://scienceserver.cilea.it/cgi-bin/sciserv.pl?collection=journals&journal=15678326&issue=v72i0001
Subject Process algebra
Elementary cellular automata
Turing completeness
Complexity indicator
NKS
Pseudo-random numbers
F.1.1 Models of Computation


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional