Wolfram’s Principle of Computational Equivalence (PCE) implies that universal complexity abounds in nature. This paper comprises three sections. In the first section we consider the question why there are so many universal phenomena around. So, in a sense, we seek a driving force behind the PCE if any. We postulate a principle GNS that we call the Generalized Natural Selection principle that to...

This paper describes four alternatives for expanding childhood insurance coverage, discusses key health policy issues, and assesses the political possibilities for enacting universal coverage. Alternatives are (1) a single federal child health program for all children; (2) a hybrid federal child health program (replacing Medicaid and the State Children's Health Insurance Program [SCHIP]), combi...

The properties of the new analytic running coupling are investigated at the higher loop levels. The expression for this invariant charge, independent of the normalization point, is obtained by invoking the asymptotic freedom condition. It is shown that at any loop level the relevant β function has the universal behaviors at small and large values of the invariant charge. Due to this feature the...

This paper discusses the employment of self-adaptation techniques in WWW-based interactive systems, as a tool for ensuring their universal accessibility. The paper first elaborates on the underpinnings of universal accessibility and their relevance to Web applications and services. Then it provides a contextual definition of self-adapting systems and an account of how self-adaptation relates to...

The expressivity of rewriting logic as meta-logic has been already convincingly illustrated. The goal of this paper is to explore the reflective capabilities of ELAN, a language based on the concepts of computational systems and rewriting logic. We define a universal theory for the class of ELAN programs and the representation function associated to this universal theory. Then we detail the eff...

We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings RC. We show that this question cannot be posed without explicitly dealing with issues raised by the choice of universal machine in the definition of Kolmogorov complexity. Among other results, we show that although for ...

The use of artificial intelligence technologies is rapidly expanding in all spheres social activity due to their significant impact on increasing the efficiency any human activity. problem research field multidisciplinary, which led emergence and various definitions its terms. lack a consensus definition term “artificial intelligence” significantly hinders development themselves, as well implem...

The paper proposes an approach how to develop a configurator (tool) allowing defining a wide range of DSML tools. The configurator is based on the idea that DSML tool definition may be given by a universal metamodel (i.e., UML class diagram), and then it can be interpreted by a universal interpreter to obtain the working tool. But for non-standard cases when the existing metamodel facilities ar...

There is no consensus on the definition of dysplasia of the hip (DH). Past and present concepts used to describe DH do not form a complete view of the pathology. Moreover, some authors still present the disease as congenital, not developmental. This prompted authors to analyze the evolution of the definition of DH. Based on the biomedical databases 500 articles and books in the field of hip dys...

We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of boolean tests which can be performed on the data produced by an election. The definition distinguishes three aspects of verifiability: individual, universal and eligibility verifiability. It also allows us to determine ...