Maurice Margenstern

From MaRDI portal
Person:415779

Available identifiers

zbMath Open margenstern.mauriceMaRDI QIDQ415779

List of research outcomes

PublicationDate of PublicationType
What Universal Turing Machines Might Tell Us2023-09-01Paper
TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES2022-12-06Paper
Multiple Fibonacci trees2022-10-25Paper
Non-erasing turing machines: A new frontier between a decidable halting problem and universality2022-08-16Paper
Cellular Automata in Hyperbolic Spaces2022-04-28Paper
https://portal.mardi4nfdi.de/entity/Q50104072021-08-25Paper
https://portal.mardi4nfdi.de/entity/Q49928742021-06-10Paper
https://portal.mardi4nfdi.de/entity/Q49928762021-06-10Paper
https://portal.mardi4nfdi.de/entity/Q51451572021-01-20Paper
A Weakly Universal Cellular Automaton in the Heptagrid of the Hyperbolic Plane2020-10-20Paper
A Decidability Result for the Halting of Cellular Automata on the Pentagrid2020-10-20Paper
A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States2020-05-28Paper
https://portal.mardi4nfdi.de/entity/Q52197422020-03-12Paper
https://portal.mardi4nfdi.de/entity/Q52197632020-03-12Paper
Infinigons of the hyperbolic plane and grossone2019-03-20Paper
https://portal.mardi4nfdi.de/entity/Q55070702016-12-16Paper
About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane2016-06-09Paper
An Algorithmic Approach to Tilings of Hyperbolic Spaces: Universality Results2016-05-11Paper
Fibonacci words, hyperbolic tilings and grossone2016-01-25Paper
https://portal.mardi4nfdi.de/entity/Q34636712016-01-19Paper
https://portal.mardi4nfdi.de/entity/Q34500122015-11-02Paper
A Weakly Universal Cellular Automaton in the Pentagrid with Five States2015-09-08Paper
Surprising Areas in the Quest for Small Universal Devices2015-03-23Paper
A Universal Cellular Automaton on the Ternary Heptagrid2015-03-23Paper
Cellular Automata and Hyperbolic Spaces2014-11-12Paper
https://portal.mardi4nfdi.de/entity/Q54122362014-04-25Paper
https://portal.mardi4nfdi.de/entity/Q53963612014-02-05Paper
https://portal.mardi4nfdi.de/entity/Q53963812014-02-05Paper
Nikolai Aleksandrovich Shanin (obituary)2013-12-17Paper
Computing by Floating Strings2013-12-06Paper
Small universal cellular automata in hyperbolic spaces. A collection of jewels2013-04-16Paper
Bacteria, Turing Machines and Hyperbolic Cellular Automata2013-02-26Paper
Using grossone to count the number of elements of infinite sets and the connection with bijections2012-11-13Paper
Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem2012-11-08Paper
An application of grossone to the study of a family of tilings of the hyperbolic plane2012-08-19Paper
An application of iterative pushdown automata to contour words of balls and truncated balls in hyperbolic tessellations2012-05-09Paper
Universality of Splicing Test Tube Systems with Two Tubes2011-11-22Paper
A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States2011-10-07Paper
https://portal.mardi4nfdi.de/entity/Q29962372011-05-06Paper
https://portal.mardi4nfdi.de/entity/Q53934912011-04-18Paper
SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS2011-02-23Paper
An Algorithmic Approach to Tilings of Hyperbolic Spaces: 10 Years Later2011-01-21Paper
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states2011-01-10Paper
Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata2010-08-31Paper
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S23452010-07-26Paper
A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors2010-05-10Paper
https://portal.mardi4nfdi.de/entity/Q35522332010-04-14Paper
In some curved spaces, one can solve NP-hard problems in polynomial time2010-01-15Paper
Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane2010-01-13Paper
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane2009-11-19Paper
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable2009-09-22Paper
https://portal.mardi4nfdi.de/entity/Q33966272009-09-19Paper
Fast Synchronization in P Systems2009-07-28Paper
Array P Systems and t.Communication2009-06-23Paper
Membrane Computing2009-05-15Paper
Membrane Computing2009-05-15Paper
https://portal.mardi4nfdi.de/entity/Q36206002009-04-14Paper
HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?2008-12-01Paper
ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE2008-12-01Paper
The domino problem of the hyperbolic plane is undecidable2008-11-18Paper
A DNA computing inspired computational model2008-11-06Paper
Generalized communicating P systems2008-11-06Paper
THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE2008-09-25Paper
About the domino problem in the hyperbolic plane from an algorithmic point of view2008-07-21Paper
https://portal.mardi4nfdi.de/entity/Q35117322008-07-11Paper
https://portal.mardi4nfdi.de/entity/Q54463092008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54463162008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54463192008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54467172008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54452442008-03-03Paper
Producer/Consumer in Membrane Systems and Petri Nets2007-11-13Paper
https://portal.mardi4nfdi.de/entity/Q54222422007-10-17Paper
https://portal.mardi4nfdi.de/entity/Q35922062007-09-12Paper
Computational Completeness of Tissue P Systems with Conditional Uniport2007-09-03Paper
P Colonies with a Bounded Number of Cells and Programs2007-09-03Paper
On small universal antiport P systems2007-03-27Paper
DNA Computing2006-10-19Paper
DNA Computing2006-10-19Paper
https://portal.mardi4nfdi.de/entity/Q54728592006-06-19Paper
DNA Computing2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q57017082005-11-04Paper
Membrane Computing2005-09-14Paper
Membrane Computing2005-09-14Paper
Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q46813052005-06-23Paper
https://portal.mardi4nfdi.de/entity/Q46628312005-03-30Paper
Context-free insertion-deletion systems2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q48256822004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48256872004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48234152004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q47376752004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47376792004-08-11Paper
ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44626312004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44534652004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44520882004-02-11Paper
The splitting method and Poincaré's theorem. II: Matrix, polynomial and language2003-10-29Paper
https://portal.mardi4nfdi.de/entity/Q31483312003-09-16Paper
A universal cellular automaton in the hyperbolic plane.2003-08-17Paper
The splitting method and Poincaré's theorem. I: The geometric part2003-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44146922003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q47821272003-05-12Paper
A package of algorithms to device cellular automata in the hyperbolic plane and related questions2003-03-09Paper
https://portal.mardi4nfdi.de/entity/Q45299752002-05-07Paper
https://portal.mardi4nfdi.de/entity/Q27706812002-02-13Paper
Two railway circuits: A universal circuit and an NP-difficult one2001-10-10Paper
On quasi-unilateral universal Turing machines2001-08-20Paper
NP problems are tractable in the space of cellular automata in the hyperbolic plane2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27092202001-05-10Paper
https://portal.mardi4nfdi.de/entity/Q45085482001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q45207822001-02-27Paper
Frontier between decidability and undecidability: A survey2000-08-23Paper
SAND PILE AS A UNIVERSAL COMPUTER2000-07-05Paper
Universality of Reversible Hexagonal Cellular Automata2000-05-09Paper
A binomial representation of the 3x + 1 problem2000-01-06Paper
Some small self-describing Turing machines1999-02-17Paper
Universality of the chip-firing game1998-07-23Paper
https://portal.mardi4nfdi.de/entity/Q43760621998-05-17Paper
The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved1997-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48586471996-05-13Paper
https://portal.mardi4nfdi.de/entity/Q48504361995-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48504641995-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42842591994-07-19Paper
Les nombres pratiques: Théorie, observations et conjectures. (Practical numbers: Theory, observations, and conjectures)1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31979111989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37579601985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33171031984-01-01Paper
SUR UNE EXTENSION SIMPLE DU CALCUL INTUITIONNISTE DES PREDICATS DU PREMIER ORDRE APPLIQUEE A L'ANALYSE1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36892431984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39374771981-01-01Paper
On a Variant of Constructivisation of the Theory of Almost Periodic Functions1978-01-01Paper
Constructive functionals in spaces of almost-periodic functions1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41354781976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41248251974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Maurice Margenstern