Register Machines Research Articles

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

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.

Двоичные решения для больших систем линейных уравнений

The concept of generic computational complexity has been extended to generalized register machines over an ordered field. In this case, the machine halts at every input and gives a meaningful answer at almost every input, but it can abandon the calculation using explicit notification, that is, there exists the vague halting state. Note that the machine does not make any error. A generic polynomial time algorithm is proposed to recognize systems of linear equations without any binary solution, when the number of equations m is close to the number of unknowns n. More precisely, two conditions are required. Firstly, the inequality 2n ≥(n-m+1)(n-m+2) holds. Such systems are called large because the number of equations is close to the number of unknowns. Secondly, some assumptions of generality of the system of equations are fulfilled. Our approach is based on finding a positive definite quadratic form among the set of forms that depend on parameters. On the other hand, a counterexample has been found, whicht shows the inapplicability of this method for checking the absence of any binary solution to one equation.

Arithmetization of Register Machines with Counters

Register machines with counters are arithmetized in class $$\mathcal{E}^{0}$$ of the Grzegorczyk hierarchy. As a sequence, we construct a new simple basis via superpositioning in Grzegorczyk class $$\mathcal{E}^{2}$$ .

An Assessment of Electronics Tax Register System Implementation and Challenges, Case of Nekemt Town Value Added Tax

The main purpose of this study is to assess Electronics tax register system implementation challenges in process of Value added tax in Nekemt town. In order to maintain the desired objectives descriptive survey research is designed for the study. Using systematic sampling method 226 tax payers were selected from the total population of 521 and purposive sampling were used to take 8 experts from ERCA office. The main data of this study was both primary and secondary data. The Statistical Package for Social Sciences (SPSS) version 20 was used to analyze data using descriptive statistics like percentage and frequencies of the variables, and arithmetic mean. The results reveal that, there are major challenges which are confronted by VAT payers for using ETRs such as; incur additional cost (machine purchase, maintenance cost) no adequate training regarding ETRs. The paper suggests that attention should be given to training regarding ETRs and Introduce ETR machine that is not expensive to tax payers. Keywords : Value added tax, Electronics tax register machine DOI: 10.7176/EJBM/12-10-03 Publication date: April 30 th 2020

IMPLEMENTATION OF BANK INDONESIA REGULATION NO. 18/40/PBI/2016 ON PAYMENT TRANSACTIONS USING CREDIT CARDS AT SHOPPING CENTERS IN BENGKULU CITY

The objective of the research was to study the implementation of Bank Indonesia Regulation No.18/40 / PBI / 2016 onDouble Swipe of Credit Card. The empirical juridical approach method in this researchused primary and secondary data as the main research data, through interviews and literature. A credit card is a credit facility provided by the issuing bank to its customers for transaction. From the research it was found thatin prior to the enactment of Bank Indonesia Regulation No.18/40/PBI/2016 on Payment Transactions Using Credit Cards, there were merchants that still do double swipe on credit card during payment transactions, first in the EDC (Electronic Data Capture) machine and on the cash register machine. However,due to the restriction on double swipe on credit card, this had been reduced. It was also strengthened by a strict regulation in the form of sanctions, reprimands and threats of crime committed by Bank Indonesia to merchants who conduct double swipe on credit card. The mechanism of bank issuing the credit card in giving approval is always different, but the terms and procedures are relatively the same. Legal protection of credit card users occurs when the signing of credit card approval agreement between the issuing bank and users since there is not clear juridical regulation. The problem mostlyarisingregarding the credit cards usage was credit card data scam. The only way to prevent this was through the use of credit cards properly, securely store credit cards when making payment transactions using credit cards, and understand the procedure of using a credit cardinpayment transactions properly. In case of credit card violation, the holder must report to the bank issuing the credit card and Bank Indonesia.

Secure Communication and Identification Systems — Effective Performance Evaluation on Turing Machines

Modern communication systems need to satisfy pre-specified requirements on spectral efficiency and security. Physical layer security is a concept that unifies both and connects them with entropic quantities. In this paper, a framework based on Turing machines is developed to address the question of deciding whether or not a communication system meets these requirements. It is known that the class of Turing solvable problems coincides with the class of algorithmically solvable problems so that this framework provides the theoretical basis for effective verification of such performance requirements. A key issue here is to decide whether or not the performance functions, i.e., capacities, of relevant communication scenarios, particularly those with secrecy requirements and active adversaries, are Turing computable. This is a necessary condition for the corresponding communication protocols to be effectively verifiable. Within this framework, it is then shown that for certain scenarios including the wiretap channel the corresponding capacities are Turing computable. Next, a general necessary condition on the performance function for Turing computability is established. With this, it is shown that for certain scenarios, including the wiretap channel with an active jammer, the performance functions are not computable when deterministic codes are used. As a consequence, such performance functions are also not computable on all other computer architectures such as the von Neumann-architecture or the register machines.

Timed Homeostasis Tissue-Like P Systems With Evolutional Symport/Antiport Rules

Tissue-like P systems are a type of distributed parallel computing models inspired by actual biological tissue. In this paper, we consider a new variant of tissue-like P systems, which is called tissue-like P systems with evolutional symport/antiport rules. Unlike traditional models of this type, in the new P systems, objects can change during transmission. In biology, an organism that is in “homeostasis” reduces its dependence on external conditions, thereby keeping it relatively constant and maintaining a relatively stable internal environment. In our work, we remove the assumption that the quantity of objects in the environment is infinite, reducing the influence of the environment on this system, so the environment no longer provides powerful energy for cells. Moreover, the time-free mode is introduced into this type of P systems, which makes the constructed systems more robust. We investigate the computational power and computational efficiency of the constructed system. Specifically, by simulating register machines, such a P system can generate any Turing computable set of numbers. In addition, we prove that this constructed system can efficiently solve the $\mathcal {SAT} $ problem. Although we restrict P systems and consider time-free manner, the results show that this system is not only Turing universal, but also can solve NP-complete problem.

Calculating correct compilers II: Return of the register machines

Abstract In ‘Calculating Correct Compilers’ (Bahr & Hutton, 2015), we developed a new approach to calculating compilers directly from specifications of their correctness. Our approach only required elementary reasoning techniques and has been used to calculate compilers for a wide range of language features and their combination. However, the methodology was focused on stack-based target machines, whereas real compilers often target register-based machines. In this article, we show how our approach can naturally be adapted to calculate compilers for register machines.

Efficiency of Cash Register Machine in Tax Collection: The Case of Merkato Area Tax Payers Office in Addis Ababa

Efficiency of Cash Register Machine in Tax Collection: The Case of Merkato Area Tax Payers Office in Addis Ababa

The Riemann Hypothesis in computer science

The Riemann Hypothesis is reformulated as the statement that particular explicitly presented register machine with 29 registers and 130 instructions never halts.

Eliminating Inequalities in Register Machines with Counters

It is proved that in programs of register machines with counters, only the equal-to/not-equal-to relations between registers and counters are essential without loss of computational capabilities.

Testing a Protocol for Characterizing Game Playing Agents Trained via Evolution on a New Game

A large series of studies on evolving agents to play mathematical games has demonstrated that many factors can significantly impact which agents arise, when those agents arise during evolution, and how robust they are in their play against other agents. Some or all of these factors have been shown to be relevant in the iterated prisoner's dilemma, the snowdrift game, and a fairly complex game called divide-the-dollar. This study demonstrates the impact or representation and agent resource allocation for a new game called coordination prisoner's dilemma. This paper demonstrates protocols from a recently published book for analysis of agent behavior and extends the work to another game, the first three-move game so treated. A new representation for agents playing mathematical games is introduced, a linear genetic programming register machine. New metrics for agent behavior including total exploitation, strategic variability, and action entropy are introduced. It is found that varying the representation and resource levels within a representation changes the types of game playing agents produced by evolution for coordination prisoner's dilemma.

Computations on register machines with counters

Abstract Computational capabilities of register machines with counters is investigated. It is shown that the class of functions that are strictly computable on register machines with counters agrees with that of total recursive functions.

Generalized P colonies with passive environment

We study two variants of P colonies with initial content of P colony and so-called passive environment: P colonies with two objects inside each agent that can only consume or generate objects, and P colonies with one object inside each agent using rewriting and communication rules. We show that the first kind of P colonies with one consumer agent and one sender agent can generate all sets of natural numbers computed by register machines, and hence they are computationally complete in the Turing sense. Similarly, also the second kind of systems with three agents with rewriting/communication rules is computationally complete. The paper improves previously published universality results concerning generalized P colonies, and it also extends the knowledge about very simple multi-agent systems capable of universal computation.

The computational power of enzymatic numerical P systems working in the sequential mode

Numerical P systems (NP systems) are a class of computing models inspired both from the structure of living cells and the economic reality. Enzymatic numerical P systems (ENP systems) are a variant of NP systems, which were successfully applied in autonomous robot control. In this work, we investigate the computational power of ENP systems working in the sequential mode: both non-deterministically sequential and deterministically sequential systems are considered. For non-deterministically sequential ENP systems, we improve a known universality result by reducing the number of membranes and programs used in the universal system from 7 to 2 and 19 to 8, respectively. For deterministically sequential ENP systems, we prove that they are Turing universal even when linear production functions are used and each function has at most two variables. As a byproduct, we obtain a small deterministic universal enzymatic numerical P system with 23 membranes and 118 programs by simulating a specific universal register machine. These results give a positive answer to an open problem formulated in Gh. Păun (2014) [37].

Extended spiking neural P systems with white hole rules and their red\u2013green variants

We consider extended spiking neural P systems with the additional possibility of so-called “white hole rules”, which send the complete contents of a neuron to other neurons, and we prove that this extension of the original model can easily simulate register machines. Based on this proof, we then define red–green variants of these extended spiking neural P systems with white hole rules and show how to go beyond Turing with these red–green systems. We also discuss the number of actor neurons needed, and the relation of this model to some special variants of Lindenmayer systems.

Watson-Crick T0L Systems and Red-Green Register Machines

Watson-Crick T0L Systems and Red-Green Register Machines

Register machines with counters

Register machines with counters (RC machines) are studied. It is shown that any computable function can be strictly computed on RC machines with a bounded number of counters and programs. The place in the Kleene–Mostowski hierarchy of certain algorithmic problems related to RC machines is determined.

Infinite Computations with Random Oracles

We consider the following problem for various infinite-time machines. If a real is computable relative to a large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent of ZFC for ordinal Turing machines with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider infinite-time Turing machines, unresetting and resetting infinite-time register machines, and α-Turing machines for countable admissible ordinals α.

A Morse Membrane Boltzmann Machine Model with Applications in Cluster Analysis

The purpose of this paper is to propose a new kind of P system on chain structure. We present the basic discrete Morse structure, membrane structures on complexes, objects with positive and negative charges and communication rules on chains. The computation completeness of Morse P system is proved by simulation of register machine. The process of Boltzmann Machines are implemented by Morse P system. A new clustering technique is described on Morse P system based Boltzmann Machines. Examples are given to show the effect of the algorithm.