scholarly journals A coinductive semantics of the Unlimited Register Machine

2011 ◽  
Vol 73 ◽  
pp. 49-63 ◽  
Author(s):  
Alberto Ciaffaglione
Keyword(s):  
Register Machine

scholarly journals Automation of an electrolytic copper register machine.

1991 ◽  
Vol 107 (6) ◽  
pp. 385-388
Author(s):  
TAKASHI SAKAMOTO
Keyword(s):  
Electrolytic Copper ◽  
Register Machine

An unlimited register machine simulator

1981 ◽  
Vol 11 (9) ◽  
pp. 999-1000
Author(s):  
John S. Hampton
Keyword(s):  
Register Machine

REGISTER MACHINE COMPUTATIONS ON BINARY NUMBERS BY OSCILLATING AND CATALYTIC CHEMICAL REACTIONS MODELLED USING MASS-ACTION KINETICS

2009 ◽  
Vol 20 (03) ◽  
pp. 411-426 ◽  
Author(s):  
THOMAS HINZE ◽  
RAFFAEL FASSLER ◽  
THORSTEN LENSER ◽  
PETER DITTRICH
Keyword(s):  
Theoretical Perspective ◽  
Reaction Network ◽  
Logic Gates ◽  
Mass Action ◽  
Machine Model ◽  
Mass Action Kinetics ◽  
Fast Switching ◽  
Register Machine ◽  
Dynamical Simulations ◽  
Concerted Reaction

Biocomputing emerged as a promising paradigm capable of coping efficiently with challenges of programming decentralized but concerted reaction systems. The chemical programming metaphor subsumes different encoding techniques into molecular or spatial structures in conjunction with artificial reaction networks. Here, a variety of supplementary assumptions like predefined polymeric sequences or availability of inhibiting reactions is frequently used. Inspired by the idea to build chemical computers based on minimal requirements in chemistry from a theoretical perspective, we introduce a pure chemical register machine model operating on binary numbers. The register machine architecture is composed of reaction network motifs acting as fast switching logic gates, oscillators, and self-reproducible bit storage units. The dynamical machine behavior consistently employs mass-action kinetics. Two case studies, calculating the maximum of three natural numbers as well as numerical addition, illustrate the practicability of the design along with dynamical simulations.

scholarly journals Register-machine based processes

2001 ◽  
Vol 48 (6) ◽  
pp. 1207-1241 ◽  
Author(s):  
Jan A. Bergstra ◽  
Alban Ponse
Keyword(s):  
Register Machine

scholarly journals From Turing machines to computer viruses

2012 ◽  
Vol 370 (1971) ◽  
pp. 3319-3339 ◽  
Author(s):  
Jean-Yves Marion
Keyword(s):  
Computability Theory ◽  
Point Of View ◽  
The Self ◽  
Turing Machines ◽  
Computer Viruses ◽  
Model Of Computation ◽  
Register Machine ◽  
Recursion Theorem ◽  
Self Replication

Self-replication is one of the fundamental aspects of computing where a program or a system may duplicate, evolve and mutate. Our point of view is that Kleene's (second) recursion theorem is essential to understand self-replication mechanisms. An interesting example of self-replication codes is given by computer viruses. This was initially explained in the seminal works of Cohen and of Adleman in the 1980s. In fact, the different variants of recursion theorems provide and explain constructions of self-replicating codes and, as a result, of various classes of malware. None of the results are new from the point of view of computability theory. We now propose a self-modifying register machine as a model of computation in which we can effectively deal with the self-reproduction and in which new offsprings can be activated as independent organisms.

Further analysis of code generation for a single register machine

1982 ◽  
Vol 18 (2) ◽  
Author(s):  
LynnRobert Carter
Keyword(s):  
Code Generation ◽  
Register Machine

scholarly journals Mechanized Theory of Event Structures: A Case of Parallel Register Machine

2021 ◽  
Vol 33 (3) ◽  
pp. 143-154
Author(s):  
Vladimir Gladstein ◽  
Dmitrii Mikhailovskii ◽  
Evgenii Moiseenko ◽  
Anton Trunov
Keyword(s):  
True Concurrency ◽  
Atomic Actions ◽  
Event Structures ◽  
The Coq Proof Assistant ◽  
Register Machine ◽  
Interleaving Semantics ◽  
Coq Proof Assistant ◽  
Concise Representation ◽  
The Individual ◽  
Semantics Of Concurrency

The true concurrency models, and in particular event structures, have been introduced in the 1980s as an alternative to operational interleaving semantics of concurrency, and nowadays they are regaining popularity. Event structures represent the causal dependency and conflict between the individual atomic actions of the system directly. This property leads to a more compact and concise representation of semantics. In this work-in-progress report, we present a theory of event structures mechanized in the COQ proof assistant and demonstrate how it can be applied to define certified executable semantics of a simple parallel register machine with shared memory.

A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID

2009 ◽  
Vol 19 (02) ◽  
pp. 227-246 ◽  
Author(s):  
MAURICE MARGENSTERN ◽  
YU SONG
Keyword(s):  
Cellular Automaton ◽  
Computer Science ◽  
Theoretical Computer Science ◽  
Simulation Tool ◽  
Theoretical Computer ◽  
Register Machine

In this paper, we significantly improve a result of the first author, published in an issue of Theoretical Computer Science in 2003. In this paper, the authors showed the existence of a weakly universal cellular automaton on the pentagrid with 22 states. The simulation used a railway circuit which simulates a register machine. In the present paper, using the same simulation tool, we lower the number of states for a weakly universal cellular automaton down to 9.

Code Generation for a One-Register Machine

1976 ◽  
Vol 23 (3) ◽  
pp. 502-510 ◽  
Author(s):  
John Bruno ◽  
Ravi Sethi
Keyword(s):  
Code Generation ◽  
Register Machine
Sign in / Sign up

Export Citation Format

Share Document