Machines, Computations, and Universality
Editat de Maurice Margenstern, Yurii Rogozhinen Limba Engleză Paperback – 9 mai 2001
Preț: 324.02 lei
Preț vechi: 405.03 lei
-20%
Puncte Express: 486
Carte tipărită la comandă
Livrare economică 10-24 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540421214
ISBN-10: 3540421211
Pagini: 336
Ilustrații: VIII, 328 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540421211
Pagini: 336
Ilustrații: VIII, 328 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2001
Editura: Springer
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.