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

Volltext

P systems with array objects and array rewriting rules von Subramanian, K. G., Saravanan, R., Geethalakshmr, M., Chandra, P. Helen, Margenstern, M.

Volltext

Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays von Umeo, Hiroshi, Hisaoka, Masaya, Teraoka, Masato, Maeda, Masashi

Volltext

East-West paths to unconventional computing von 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

Volltext

Nikolai Aleksandrovich Shanin (obituary) von Vsemirnov, M A, Hirsch, È A, Grigor'ev, D Yu, Davydov, G V, Dantsin, E Ya, Zaslavskii, I D, Karavaev, E F, Konev, B Yu, Kossovskii, N K, Lifschitz, V A, Margenstern, M, Matiyasevich, Yu V, Mints, G E, Orevkov, V P, Pliuškevičius, R, Slisenko, A O, Solov'ev, S V, Chernov, V P

Volltext

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

Volltext

Attacking the Common Algorithmic Problem by Recognizer P Systems von Pérez Jiménez, Mario J., Romero Campero, Francisco J.

Volltext

Accepting Hybrid Networks of Evolutionary Processors von Margenstern, Maurice, Mitrana, Victor, Pérez-Jiménez, Mario J.

Volltext

Nonerasing Turing machines: a frontier between a decidable halting problem and universality von Margenstern, M.

Volltext

Algorithmic Randomness, Quantum Physics, and Incompleteness von Calude, Cristian S.

Volltext

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

Volltext

On Almost φ-Lagrange Spaces von Pandey, P. N., Shukla, Suresh K.

Volltext

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

Volltext

Computational Universality in Symbolic Dynamical Systems von Delvenne, Jean-Charles, Kůrka, Petr, Blondel, Vincent D.

Volltext

Solving 3CNF-SAT and HPP in Linear Time Using WWW von Manea, Florin, Martín-Vide, Carlos, Mitrana, Victor

Volltext

Sequential P Systems with Unit Rules and Energy Assigned to Membranes von Freund, Rudolf, Leporati, Alberto, Oswald, Marion, Zandron, Claudio

Volltext

Classification and Universality of Reversible Logic Elements with One-Bit Memory von Morita, Kenichi, Ogiro, Tsuyoshi, Tanaka, Keiji, Kato, Hiroko

Volltext

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

Volltext

Universality and Cellular Automata von Sutner, K.

Volltext

Ordering and Convex Polyominoes von Castiglione, Giusi, Restivo, Antonio

Volltext