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

Generating Diophantine Sets 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 set generating devices are considered. Then, the universality of non-restricted virus machines is proved by showing that they can compute all diophantine sets, which the MRDP theorem proves that coincide with the recursively enumerable sets.Ministerio de Economía y Competitividad TIN2012- 3743

A Storm in an IoT Cup: The Emergence of Cyber-Physical Social Machines

The concept of social machines is increasingly being used to characterise various socio-cognitive spaces on the Web. Social machines are human collectives using networked digital technology which initiate real-world processes and activities including human communication, interactions and knowledge creation. As such, they continuously emerge and fade on the Web. The relationship between humans and machines is made more complex by the adoption of Internet of Things (IoT) sensors and devices. The scale, automation, continuous sensing, and actuation capabilities of these devices add an extra dimension to the relationship between humans and machines making it difficult to understand their evolution at either the systemic or the conceptual level. This article describes these new socio-technical systems, which we term Cyber-Physical Social Machines, through different exemplars, and considers the associated challenges of security and privacy.Comment: 14 pages, 4 figure

Tree transducers, L systems, and two-way machines

A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions on the “copying power” of these devices endow them with rich structuring and give insight into the issues of determinism, parallelism, and copying. Among the parallel rewriting systems considered are the top-down tree transducer; the generalized syntax-directed translation scheme and the ETOL system, and among the two-way machines are the tree-walking automaton, the two-way finite-state transducer, and (generalizations of) the one-way checking stack automaton. The. relationship of these devices to macro grammars is also considered. An effort is made .to provide a systematic survey of a number of existing results

Computing with viruses

In recent years, different computing models have emerged within the area of Unconven-tional Computation, and more specifically within Natural Computing, getting inspiration from mechanisms present in Nature. In this work, we incorporate concepts in virology and theoretical computer science to propose a novel computational model, called Virus Ma-chine. Inspired by the manner in which viruses transmit from one host to another, a virus machine is a computational paradigm represented as a heterogeneous network that con-sists of three subnetworks: virus transmission, instruction transfer, and instruction-channel control networks. Virus machines provide non-deterministic sequential devices. As num-ber computing devices, virus machines are proved to be computationally complete, that is, equivalent in power to Turing machines. Nevertheless, when some limitations are imposed with respect to the number of viruses present in the system, then a characterization for semi-linear sets is obtained

Turing Automata and Graph Machines

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example

Research and design of corporate networks infrastructure using SDN technologies with emphasis to virtual switch

Software Defined Networking has brought revolution to the world of Network technology which replaces most of the physical devices and control layer of the cloud computing reference model takes control of many Networking Devices. A Virtual Switch is a software by the virtue of which communication between several virtual machines take place. In contrast to physical switch is, it does not only forwards data packets but also checks the data for security before it is forwarded to other virtual machines. Interrelated components of software components work together to form a virtual network infrastructure. Out of the software components, the emphasis is targeted on Virtual switch functions and how it differs from the traditional switches

HYDROPULSE SYSTEM WITH POWERFUL PROTECTION OF MINING MACHINES FROM FLUCTUATIONS

Improvement of the structure, definition of rational parameters of the transient devices of the hydraulic pulse system (HPS) and evaluation of the efficiency of the use of repulsive clusters (RC) for vibration protection of base machines

State machines for large scale computer software and systems

A method for specifying the behavior and architecture of discrete state systems such as digital electronic devices and software using deterministic state machines and automata products. The state machines are represented by sequence maps $f:A^*\to X$ where $f(s)=x$ indicates that the output of the system is $x$ in the state reached by following the sequence of events $s$ from the initial state. Examples provided include counters, networks, reliable message delivery, real-time analysis of gates and latches, and producer/consumer. Techniques for defining, parameterizing, characterizing abstract properties, and connecting sequence functions are developed. Sequence functions are shown to represent (possibly non-finite) Moore type state machines and general products of state machines. The method draws on state machine theory, automata products, and recursive functions and is ordinary working mathematics, not involving formal methods or any foundational or meta-mathematical techniques. Systems in which there are levels of components that may operate in parallel or concurrently are specified in terms of function composition