MCU
2004
13 years 5 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
MCU
2004
13 years 5 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
MCU
2004
13 years 5 months ago
2004
geometrical computation for Black hole computation d abstract) J
MCU
2004
13 years 5 months ago
2004
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
MCU
2004
13 years 5 months ago
2004
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
MCU
2004
13 years 5 months ago
2004
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
MCU
2004
13 years 5 months ago
2004
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing...
MCU
2004
13 years 5 months ago
2004
P systems with active membranes using only two electrical charges and only rules of type (a) , i.e., evolution rules used in parallel in the regions of the membrane system, and of ...
MCU
2007
13 years 5 months ago
2007
MCU
2007
13 years 5 months ago
2007