52 search results - page 4 / 11 » Simulating Turing machines on Maurer machines |
LOGCOM
2010
13 years 2 months 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...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
JIFS
2002
13 years 7 months ago
2002
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
EUROGP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
TCS
2010
13 years 2 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...