In some curved spaces, one can solve NP-hard problems in polynomial time

[1]  M. Margenstern.  Cellular Automata in Hyperbolic Spaces , 2009, Encyclopedia of Complexity and Systems Science.

[2]  Günter von Kiedrowski,et al.  Self replicating systems , 2007 .

[3]  Maurice Margenstern.  An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces , 2006, FCS.

[4]  Maurice Margenstern.  Correction to the Paper: A New Way to Implement Cellular Automata on the Penta- and Heptagrids , 2006, J. Cell. Autom..

[5]  Hanif D. Sherali,et al.  The Concept of an Algorithm , 2005 .

[6]  Hod Lipson,et al.  Robotics: Self-reproducing machines , 2005, Nature.

[7]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[8]  Maurice Margenstern,et al.  Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment , 2004, ACRI.

[9]  Vladik Kreinovich,et al.  Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications , 2004, Reliab. Comput..

[10]  Gregory H. Harris,et al.  Review of "Abstract state machines: a method for high-level system design and analysis" by Egon Börger and Robert Stärk. Springer-Verlag 2003. , 2004, SOEN.

[11]  Maurice Margenstern,et al.  Register Cellular Automata in the Hyperbolic Plane , 2004, Fundam. Informaticae.

[12]  Maurice Margenstern,et al.  The Tiling of the Hyperbolic 4D Space by the 120-cell is Combinatoric , 2004, J. Univers. Comput. Sci..

[13]  Maurice Margenstern,et al.  Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey , 2003, DMTCS.

[14]  Maurice Margenstern,et al.  Tools for devising cellular automata in the hyperbolic 3D space , 2003, Fundam. Informaticae.

[15]  Egon Börger,et al.  Abstract State Machines. A Method for High-Level System Design and Analysis , 2003 .

[16]  Wolfgang Reisig.  On Gurevich's theorem on sequential algorithms , 2003, Acta Informatica.

[17]  Maurice Margenstern,et al.  A universal cellular automaton in the hyperbolic plane , 2003, Theor. Comput. Sci..

[18]  Maurice Margenstern.  A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology , 2003, Computers and Their Applications.

[19]  Andreas Blass,et al.  Algorithms: A Quest for Absolute Definitions , 2003, Bull. EATCS.

[20]  Maurice Margenstern,et al.  NP problems are tractable in the space of cellular automata in the hyperbolic plane , 2001, Theor. Comput. Sci..

[21]  Andrei Voronkov,et al.  Current Trends in Theoretical Computer Science , 2001 .

[22]  Yuri Gurevich,et al.  Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[23]  Maurice Margenstern,et al.  New Tools for Cellular Automata in the Hyperbolic Plane , 2000, J. Univers. Comput. Sci..

[24]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation , 1999, Bull. EATCS.

[25]  Maurice Margenstern,et al.  A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane , 1999, J. Univers. Comput. Sci..

[26]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[27]  V. Kreinovich,et al.  Problems of reducing the exhaustive search , 1996 .

[28]  Egon Börger.  Specification and validation methods , 1995 .

[29]  Yuri Gurevich.  Specification and validation methods , 1993, Specification and validation methods.

[30]  Vladik Kreinovich,et al.  Which Algorithms Are Feasible And Which Are Not Depends On The Geometry Of Space-Time , 1995 .

[31]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[32]  Yuri Gurevich,et al.  On Kolmogorov Machines and Related Issues , 2017, Current Trends in Theoretical Computer Science.

[33]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[34]  Alexei Semenov,et al.  Algorithms: Main Ideas and Applications , 1993 .

[35]  Yuri Gurevich,et al.  Evolving Algebras: an Attempt to Discover Semantics , 1993, Current Trends in Theoretical Computer Science.

[36]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[37]  Ehud Shapiro,et al.  Spatial machines: a more realistic approach to parallel computation , 1992, CACM.

[38]  P. Gács,et al.  Algorithms , 1992 .

[39]  Michael Gelfond,et al.  Theory of deductive systems and its applications , 1987 .

[40]  Boris A. Trakhtenbrot,et al.  A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.

[41]  D. Grigor'ev,et al.  Kolmogoroff algorithms are stronger than turing machines , 1980 .

[42]  Robert A. Freitas,et al.  A self-reproducing interstellar probe. , 1980 .

[43]  Chris Boyce.  Extraterrestrial encounter : a personal perspective , 1979 .

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  Al Young.  Providence, Rhode Island , 1975 .

[46]  A. Cameron,et al.  Interstellar communication; scientific perspectives , 1974 .

[47]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[48]  Michael A. Arbib,et al.  Theories of abstract automata , 1969, Prentice-Hall series in automatic computation.

[49]  Michael A. Arbib,et al.  Simple Self-Reproducing Universal Automata , 1966, Inf. Control..

[50]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[51]  V. A. Uspenski,et al.  On the Definition of an Algorithm , 1963 .

[52]  L. Penrose,et al.  Self-Reproducing Machines , 1959 .

[53]  I. Rabinovitch,et al.  NON-EUCLIDEAN GEOMETRY. , 1906, Science.