Machines, Computations, and Universality: Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings: Lecture Notes in Computer Science, cartea 2055
Editat de Maurice Margenstern, Yurii Rogozhinen Limba Engleză Paperback – 9 mai 2001
Din seria Lecture Notes in Computer Science
- 20%
Preț: 400.77 lei - 20%
Preț: 754.11 lei - 20%
Preț: 324.19 lei - 20%
Preț: 373.80 lei - 20%
Preț: 342.61 lei - 20%
Preț: 403.00 lei - 20%
Preț: 573.45 lei -
Preț: 395.25 lei - 20%
Preț: 487.46 lei - 20%
Preț: 355.27 lei - 20%
Preț: 731.97 lei - 20%
Preț: 293.24 lei - 20%
Preț: 669.21 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 336.86 lei - 20%
Preț: 330.54 lei - 20%
Preț: 313.87 lei - 20%
Preț: 679.09 lei - 20%
Preț: 373.16 lei - 20%
Preț: 782.57 lei - 20%
Preț: 434.17 lei - 20%
Preț: 489.11 lei - 20%
Preț: 904.16 lei - 20%
Preț: 375.72 lei - 20%
Preț: 400.17 lei - 20%
Preț: 432.78 lei - 20%
Preț: 631.96 lei - 20%
Preț: 432.11 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 556.96 lei - 20%
Preț: 488.90 lei - 20%
Preț: 560.93 lei - 20%
Preț: 327.36 lei - 20%
Preț: 340.04 lei - 20%
Preț: 327.36 lei - 20%
Preț: 328.94 lei - 20%
Preț: 629.71 lei - 20%
Preț: 568.70 lei - 20%
Preț: 447.31 lei - 20%
Preț: 733.68 lei - 20%
Preț: 315.26 lei - 20%
Preț: 315.62 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 850.42 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 519.32 lei
Preț: 332.42 lei
Preț vechi: 415.53 lei
-20%
Puncte Express: 499
Preț estimativ în valută:
58.84€ • 68.35$ • 50.98£
58.84€ • 68.35$ • 50.98£
Carte tipărită la comandă
Livrare economică 02-16 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540421214
ISBN-10: 3540421211
Pagini: 336
Ilustrații: VIII, 328 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.78 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540421211
Pagini: 336
Ilustrații: VIII, 328 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.78 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures Notes.- Three Small Universal Turing Machines.- Computation in Gene Networks.- Power, Puzzles and Properties of Entanglement.- Combinatorial and Computational Problems on Finite Sets of Words.- Computing with Membranes (P Systems): Universality Results.- A Simple Universal Logic Element and Cellular Automata for Reversible Computing.- Some Applications of the Decidability of DPDA’s Equivalence.- The Equivalence Problem for Computational Models: Decidable and Undecidable Cases.- Two Normal Forms for Rewriting P Systems.- Technical Contributions.- On a Conjecture of K?rka. A Turing Machine with No Periodic Configurations.- On the Transition Graphs of Turing Machines.- JC-Nets.- JC-Nets.- Nonterminal Complexity of Programmed Grammars.- Nonterminal Complexity of Programmed Grammars.- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.- A Direct Construction of a Universal Extended H System.- A Direct Construction of a Universal Extended H System.- Speeding-Up Cellular Automata by Alternations.- Speeding-Up Cellular Automata by Alternations.- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.- P Systems with Membrane Creation: Universality and Efficiency.- P Systems with Membrane Creation: Universality and Efficiency.- On the Computational Power of a Continuous-space Optical Model of Computation.- On theComputational Power of a Continuous-space Optical Model of Computation.- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).- D0L System + Watson-Crick Complementarity = Universal Computation.- D0L System + Watson-Crick Complementarity = Universal Computation.
Caracteristici
Includes supplementary material: sn.pub/extras