In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

The investigation of the foundational aspects of linguistic mechanisms for programming long running transactions (such as the scope operator of WS-BPEL) has recently renewed the interest in process algebraic operators that interrupt the execution of one process, replacing it with another one called the compensation. We investigate the expressive power of two of such operators, the interrupt ope...

We show that a random-access machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended Church-Turing Thesis.

In this paper, we look at extended H systems in order to find how small such a system can be in order to generate a recursively enumerable language. It turns out that starting from a Turing machine M with alphabet A and finite set of states Q which generates a given recursively enumerable language L, we need around 2×|I|+2 rules in order to define an extended H system H which generates L, where...

It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, Turing-Complete. This achieved via direct simulation a machine. Unlike previously informally presented constructions, we do not encode finite control many times, need only one trigger/ball-hopper pair, prove our construction correct. We believe this first natural extensio...

Vagueness is a linguistic phenomenon as well as a property of physical objects. Fuzzy set theory is a mathematical model of vagueness that has been used to define vague models of computation. The prominent model of vague computation is the fuzzy Turing machine. This conceptual computing device gives an idea of what computing under vagueness means, nevertheless, it is not the most natural model....