Search Results - "Margenstern, M."

NP problems are tractable in the space of cellular automata in the hyperbolic plane by Margenstern, Maurice, Morita, Kenichi

“…In this paper, we define cellular automata on a grid of the hyperbolic plane that is based on the tessellation obtained from the regular pentagon with right…”
Get full text

Nine switch-affine neurons suffice for Turing universality by Siegelmann, H.T., Margenstern, M.

“…In a previous work Pollack showed that a particular type of heterogeneous processor network is Turing universal. Siegelmann and Sontag (1991) showed the…”
Get full text

Frontier between decidability and undecidability: a survey by Margenstern, Maurice

Get full text

East-West paths to unconventional computing by Adamatzky, Andrew, Akl, Selim, Burgin, Mark, Calude, Cristian S., Costa, José Félix, Dehshibi, Mohammad Mahdi, Gunji, Yukio-Pegio, Konkoli, Zoran, MacLennan, Bruce, Marchal, Bruno, Margenstern, Maurice, Martínez, Genaro J., Mayne, Richard, Morita, Kenichi, Schumann, Andrew, Sergeyev, Yaroslav D., Sirakoulis, Georgios Ch, Stepney, Susan, Svozil, Karl, Zenil, Hector

“…Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited…”
Get full text

In some curved spaces, one can solve NP-hard problems in polynomial time by Kreinovich, V., Margenstern, M.

“…In the late 1970s and early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for…”
Get full text

Context-free insertion–deletion systems by Margenstern, Maurice, Păun, Gheorghe, Rogozhin, Yurii, Verlan, Sergey

“…We consider a class of insertion–deletion systems which have not been investigated so far, those without any context controlling the insertion–deletion…”
Get full text

A DNA computing inspired computational model by Franco, Giuditta, Margenstern, Maurice

“…In this paper we propose a universal rewriting system whose computational steps closely resemble the manner in which nature computes double stranded DNA…”
Get full text

Frontier between decidability and undecidability : a survey: Universal Machines and Computations by MARGENSTERN, M

Get full text

A universal cellular automaton in the hyperbolic plane by Herrmann, Francine, Margenstern, Maurice

“…The paper gives the construction of a universal CA with 22 states in the regular rectangular pentagonal grid of the hyperbolic plane. The CA implements a…”
Get full text

On quasi-unilateral universal Turing machines by Margenstern, Maurice

“…Four universal Turing machines are given with strong limitations on the number of left instructions in their program. One of the machines is morever…”
Get full text

On P systems with bounded parallelism by Bernardini, F., Romero-Campero, F.J., Gheorghe, M., Perez-Jimenez, M.J., Margenstern, M., Verlan, S., Krasnogor, N.

“…A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into…”
Get full text

Universality of the chip-firing game by Goles, Eric, Margenstern, Maurice

“…We prove that the parallel updating of the chip-firing game on undirected graphs is universal. To achieve that, we simulate any given two-register machine by…”
Get full text

A universal time-varying distributed H-system of degree 2 by Margenstern, Maurice, Rogozhin, Yurii

“…A time-varying distributed H system is a splicing system which has the following feature: at different moments one uses different sets of splicing rules. The…”
Get full text

Some small self-describing Turing machines by M. Margenstern, Yu. Rogozhin

“…Several small self-describing Turing machines are constructed. The number of instructions varies from 275 to 206, depending on the chosen encoding principles…”
Get full text

Finite H-systems with 3 test tubes are not predictable by Priese, L, Rogojine, Y, Margenstern, M

“…Finite H-systems with n test tubes are splicing systems of n test tubes over a common molecular alphabet, sigma, with a filter Fi [symbol: see text] sigma for…”
Get more information