Computing Partial Recursive Functions by Virus Machines

Virus Machines are a computational paradigm inspired by the manner in which viruses replicate and transmit from one host cell to another. This paradigm provides non-deterministic sequential devices. Non-restricted Virus Machines are unbounded Virus Machines, in the sense that no restriction on the number of hosts, the number of instructions and the number of viruses contained in any host along any computation is placed on them. The computational completeness of these machines has been obtained by simulating register machines. In this paper, Virus Machines as function computing devices are considered. Then, the universality of non-restricted virus machines is proved by showing that they can compute all partial recursive functions.Ministerio de Economía y Competitividad TIN2012- 3743

Novelty And Surprises In Complex Adaptive System (CAS) Dynamics: A Computational Theory of Actor Innovation

The work of John von Neumann in the 1940's on self-reproducing machines as models for biological systems and self-organized complexity provides the computational legacy for CAS. Following this, the major hypothesis emanating from Wolfram (1984), Langton (1992, 1994), Kaufmann (1993) and Casti (1994) is that the sine qua non of complex adaptive systems is their capacity to produce novelty or 'surprises' and the so called Type IV innovation based structure changing dynamics of the Wolfram-Chomsky schema. The Wolfram-Chomsky schema postulates that on varying the computational capabilities of agents, different system wide dynamics can be generated: finite automata produce Type I dynamics with unique limit points or homogeneity; push down automata produce Type II dynamics with limit cycles; linear bounded automata generate Type III chaotic trajectories with strange attractors. The significance of this schema is that it postulates that only agents with the full powers of Turing Machines capable of simulating other Turing Machines, which Wolfram calls computational universality can produce Type IV irregular innovation based structure changing dynamics associated with the three main natural exponents of CAS, evolutionary biology, immunology and capitalist growth. Langton (1990,1992) identifies the above complexity classes for dynamical systems with the halting problem of Turing machines and famously calls the phase transition or the domain on which novel objects emerge as 'life at the edge of chaos'. This paper develops the formal foundations for the emergence of novelty or innovation. Remarkably, following Binmore(1987) who first introduced to game theory the requisite dose of mechanism with players modelled as Turing Machines with the Gödel (1931) logic involving the Liar or the pure logic of opposition, we will see that only agents qua universal Turing Machines which can make self-referential calculation of hostile objectives can bring about adaptive novelty or strategic innovation

Planning And Scheduling For Large-scaledistributed Systems

Many applications require computing resources well beyond those available on any single system. Simulations of atomic and subatomic systems with application to material science, computations related to study of natural sciences, and computer-aided design are examples of applications that can benefit from the resource-rich environment provided by a large collection of autonomous systems interconnected by high-speed networks. To transform such a collection of systems into a user\u27s virtual machine, we have to develop new algorithms for coordination, planning, scheduling, resource discovery, and other functions that can be automated. Then we can develop societal services based upon these algorithms, which hide the complexity of the computing system for users. In this dissertation, we address the problem of planning and scheduling for large-scale distributed systems. We discuss a model of the system, analyze the need for planning, scheduling, and plan switching to cope with a dynamically changing environment, present algorithms for the three functions, report the simulation results to study the performance of the algorithms, and introduce an architecture for an intelligent large-scale distributed system

Process as a world transaction

Transaction is process closure: for a transaction is the limiting process of process itself. In the process world view the universe is the ultimate (intensional) transaction of all its extensional limiting processes that we call reality. ANPA’s PROGRAM UNIVERSE is a computational model which can be explored empirically in commercial database transactions where there has been a wealth of activity over the real world for the last 40 years. Process category theory demonstrates formally the fundamental distinctions between the classical model of a transaction as in PROGRAM UNIVERSE and physical reality. The paper concludes with a short technical summary for those who do not wish to read all the detail