11 search results - page 2 / 3 » Improved simulation of nondeterministic Turing machines |
INFORMATICALT
2010
13 years 2 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
LOGCOM
2010
13 years 5 days ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
ENTCS
2007
13 years 5 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
DNA
2007
Springer
13 years 11 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...