Margenstern (36 Ergebnisse)

Zustand: Very Good. 1st Edition. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. …

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Neuware -Invited Talks.- Encapsulating Reaction-Diffusion Computers.- On the Computational Capabilities of Several Models.- Universality, Reducibility, and Completeness.- Using Approximation to Relate Computational Classes over the Reals.- A Survey of Infinite Time Turing Machines.- The Tiling Problem Revisited (Extended Abstract).- Decision Versus Evaluation in Algebraic Complexity.- A Universal Reversible Turing Machine.- P Systems and Picture Languages.- Regular Papers.- Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.- Uniform Solution of QSAT Using Polarizationless Active Membranes.- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.- Planar Trivalent Network Computation.- On the Power of Networks of Evolutionary Processors.- Study of Limits of Solvability in Tag Systems.- Query Completeness of Skolem Machine Computations.- More on the Size of Higman-Haines Sets: Effective Constructions.- Insertion-Deletion Systems with One-Sided Contexts.- Accepting Networks of Splicing Processors with Filtered Connections.- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.- Four Small Universal Turing Machines.- Changing the Neighborhood of Cellular Automata.- A Simple P-Complete Problem and Its Representations by Language Equations.- Slightly Beyond Turing's Computability for Studying Genetic Programming.- A Smallest Five-State Solution to the Firing Squad Synchronization Problem.- Small Semi-weakly Universal Turing Machines.- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution.…

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: Brand New. 1st edition. 324 pages. 9.00x6.00x0.75 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware - This book constitutes the refereed proceedings of the 5th International Conference on Machines, Computations, and Universality, MCU 2007, held in Orleans, France, September 2007. The 18 revised full papers presented together with nine invited papers cover Turing machines, register machines, word processing, cellular automata, tiling of the plane, neural networks, molecular computations, BSS machines, infinite cellular automata, real machines, and quantum computing.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - In the rst part of the present volume of LNCS, the reader will nd the invited talks given at the MCU 2001 conference. In the second part, he/she will nd the contributions that were presented at the conference after selection. In both cases, papers are arranged in the alphabetical order of the authors. MCU 2001 is the third conference in theoretical computer science, Machines, computations and universality, formerly, Machines et calculs universels. Both previous conferences, MCU'95 and MCU'98, were organized by Maurice M- genstern in Paris and in Metz (France), respectively. From the very beginning, MCU conferences have been an international sci- ti c event. For the third conference, in order to stress that aspect, it was decided to hold it outside France. Moldova was chosen thanks to the close cooperation between the present chairmen of MCU 2001. MCU 2001 also aims at high scienti c standards. We hope that the present volume will convince the reader that the tradition of previous conferences have been upheld by this one. Cellular automata and molecular computing are well represented in this volume. And this is also the case for quantum computing, f- mal languages, and the theory of automata. MCU 2001 does not fail its tradition of providing our community with important results on Turing machines.…

hardcover. Zustand: Sehr gut. 329 Seiten; 9783642366628.2 Gewicht in Gramm: 1.

Taschenbuch. Zustand: Neu. Machines, Computations, and Universality | 5th International Conference, MCU 2007, Orleans, France, September 10-13, 2007, Proceedings | Jérôme Durand-Lose (u. a.) | Taschenbuch | x | Englisch | 2007 | Springer | EAN 9783540745921 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Zustand: Neu. Machines, Computations, and Universality | Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings | Maurice Margenstern (u. a.) | Taschenbuch | viii | Englisch | 2001 | Springer | EAN 9783540421214 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Softcover Sehr gut erhalten, wie neu.

Taschenbuch. Zustand: Neu. Neuware -Invited Talks.- Encapsulating Reaction-Diffusion Computers.- On the Computational Capabilities of Several Models.- Universality, Reducibility, and Completeness.- Using Approximation to Relate Computational Classes over the Reals.- A Survey of Infinite Time Turing Machines.- The Tiling Problem Revisited (Extended Abstract).- Decision Versus Evaluation in Algebraic Complexity.- A Universal Reversible Turing Machine.- P Systems and Picture Languages.- Regular Papers.- Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.- Uniform Solution of QSAT Using Polarizationless Active Membranes.- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.- Planar Trivalent Network Computation.- On the Power of Networks of Evolutionary Processors.- Study of Limits of Solvability in Tag Systems.- Query Completeness of Skolem Machine Computations.- More on the Size of Higman-Haines Sets: Effective Constructions.- Insertion-Deletion Systems with One-Sided Contexts.- Accepting Networks of Splicing Processors with Filtered Connections.- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.- Four Small Universal Turing Machines.- Changing the Neighborhood of Cellular Automata.- A Simple P-Complete Problem and Its Representations by Language Equations.- Slightly Beyond Turing's Computability for Studying Genetic Programming.- A Smallest Five-State Solution to the Firing Squad Synchronization Problem.- Small Semi-weakly Universal Turing Machines.- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution. 340 pp. Englisch.…

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Small Universal Cellular Automata in Hyperbolic Spaces | A Collection of Jewels | Maurice Margenstern | Taschenbuch | Emergence, Complexity and Computation | ix | Englisch | 2015 | Springer | EAN 9783642442049 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Hyperbolic geometry is an essential part of theoretical astrophysics and cosmology. Besides specialists of these domains, many specialists of new domains start to show a growing interestboth to hyperbolic geometry and to cellular automata. This is especially the case in biology and computer science. This book gives the reader a deep and efficient introduction to an algorithmic approach to hyperbolic geometry. It focuses the attention on the possibilities to obtain in this frame the power of computing everything a computer can compute, that is to say: universality. The minimal ways to get universality are investigated in a large family of tilings of the hyperbolic plane. In several cases the best results are obtained.In all cases, the results are close to the theoretical best values. This gives rise to fantastic illustrations: the results are jewels in all meanings of the word.------------------------ Maurice MARGENSTERN is professor emeritus at the University of Lorraine, he is a member of LITA, the research unit of computer science in the campus of Metz of this university. Professor Margenstern is amongst top world experts in theory of computation, mathematical machines and geometry. He is a pioneer in cellular automata in hyperbolic spaces.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Hyperbolic geometry is an essential part of theoretical astrophysics and cosmology. Besides specialists of these domains, many specialists of new domains start to show a growing interestboth to hyperbolic geometry and to cellular automata. This is especially the case in biology and computer science. This book gives the reader a deep and efficient introduction to an algorithmic approach to hyperbolic geometry. It focuses the attention on the possibilities to obtain in this frame the power of computing everything a computer can compute, that is to say: universality. The minimal ways to get universality are investigated in a large family of tilings of the hyperbolic plane. In several cases the best results are obtained.In all cases, the results are close to the theoretical best values. This gives rise to fantastic illustrations: the results are jewels in all meanings of the word.------------------------ Maurice MARGENSTERN is professor emeritus at the University of Lorraine, he is a member of LITA, the research unit of computer science in the campus of Metz of this university. Professor Margenstern is amongst top world experts in theory of computation, mathematical machines and geometry. He is a pioneer in cellular automata in hyperbolic spaces.…

Gebundene Ausgabe. Zustand: Neu. Hyperbolic geometry is an essential part of theoretical astrophysics and cosmology. Besides specialists of these domains, many specialists of new domains start to show a growing interestboth to hyperbolic geometry and to cellular automata. This is especially the case in biology and computer science. This book gives the reader a deep and efficient introduction to an algorithmic approach to hyperbolic geometry. It focuses the attention on the possibilities to obtain in this frame the power of computing everything a computer can compute, that is to say: universality. The minimal ways to get universality are investigated in a large family of tilings of the hyperbolic plane. In several cases the best results are obtained.In all cases, the results are close to the theoretical best values. This gives rise to fantastic illustrations: the results are jewels in all meanings of the word.------------------------ Maurice MARGENSTERN is professor emeritus at the University of Lorraine, he is a member of LITA, the research unit of computer science in the campus of Metz of this university. Professor Margenstern is amongst top world experts in theory of computation, mathematical machines and geometry. He is a pioneer in cellular automata in hyperbolic spaces. Sprache: Englisch Gewicht in Gramm: 612.…

Hardcover. Zustand: Brand New. 2013 edition. 320 pages. 9.25x6.25x0.75 inches. In Stock.

Zustand: gut. 2013. Small Universal Cellular Automata in Hyperbolic Spaces: A Collection of Jewels (Emergence, Complexity and Computation, 4, Band 4) In deutscher Sprache. pages.

Paperback. Zustand: Brand New. 2013 edition. 332 pages. 9.25x6.10x0.75 inches. In Stock.

Couverture souple. Zustand: Très bon. Edition originale. Coin inferieur droit couverture arriere legerement erase. Interieur du livre en tres bon etat. NA10609, 1003D1, 9781933153063.

paperback. Zustand: Gut. 220 Seiten; 9782746507753.3 Gewicht in Gramm: 500.

Couverture souple. Zustand: Neuf. NA10175, 1174D2, 9781933153049 GB Scientific Publications EAN 9782847030334.