menu
{ "item_title" : "Computing with New Resources", "item_author" : [" Cristian S. Calude", "Rūsiņs Freivalds", "Iwama Kazuo "], "item_description" : "Counting With Probabilistic and Ultrametric Finite Automata.- Systolic Automata and P Systems.- Soliton Automata with Multiple Waves.- On Power Series over a Graded Monoid.- Advances on Random Sequence Generation by Uniform Cellular Automata.- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages.- Aspects of Reversibility for Classical Automata.- A Weakly Universal Cellular Automaton in the Pentagrid with Five States.- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem.- Time-Optimum Smaller-State Synchronizers for Cellular Automata.- Computing Boolean Functions via Quantum Hashing.- Complexity of Promise Problems on Classical and Quantum Automata.- Quantum Complexity of Boolean Matrix Multiplication and Related Problems.- Quantum Distributed Computing Applied to Grover's Search Algorithm.- Maximally Entangled State in Pseudo-Telepathy Games.- Quantum Finite Automata: A Modern Introduction.- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture.- From Quantum Query Complexity to State Complexity.- Small Universal Devices.- A Technique to Obtain Hardness Results for Randomized Online Algorithms.- Integral Difference Ratio Functions on Integers.- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources.- Symmetries and Dualities in Name-Passing Process Calculi.- Learning from Positive Data and Negative Counterexamples.- One-Sided Random Context Grammars.- How Can We Construct Reversible Machines out of Reversible Logic Element with Memory?.- On Evolutionary Approximation of Logic Circuits.- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems.- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds.- P Systems with Anti-Matter.- A Robust Universal Flying Amorphous Computer.- Minimal Reaction Systems Defining Subset Functions.- Grand Challenges of Informatics.- Konrad Zuse's Relationship to Informatics.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/913/349/3319133497_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Computing with New Resources|Cristian S. Calude

Computing with New Resources : Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Counting With Probabilistic and Ultrametric Finite Automata.- Systolic Automata and P Systems.- Soliton Automata with Multiple Waves.- On Power Series over a Graded Monoid.- Advances on Random Sequence Generation by Uniform Cellular Automata.- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages.- Aspects of Reversibility for Classical Automata.- A Weakly Universal Cellular Automaton in the Pentagrid with Five States.- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem.- Time-Optimum Smaller-State Synchronizers for Cellular Automata.- Computing Boolean Functions via Quantum Hashing.- Complexity of Promise Problems on Classical and Quantum Automata.- Quantum Complexity of Boolean Matrix Multiplication and Related Problems.- Quantum Distributed Computing Applied to Grover's Search Algorithm.- Maximally Entangled State in Pseudo-Telepathy Games.- Quantum Finite Automata: A Modern Introduction.- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture.- From Quantum Query Complexity to State Complexity.- Small Universal Devices.- A Technique to Obtain Hardness Results for Randomized Online Algorithms.- Integral Difference Ratio Functions on Integers.- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources.- Symmetries and Dualities in Name-Passing Process Calculi.- Learning from Positive Data and Negative Counterexamples.- One-Sided Random Context Grammars.- How Can We Construct Reversible Machines out of Reversible Logic Element with Memory?.- On Evolutionary Approximation of Logic Circuits.- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems.- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds.- P Systems with Anti-Matter.- A Robust Universal Flying Amorphous Computer.- Minimal Reaction Systems Defining Subset Functions.- Grand Challenges of Informatics.- Konrad Zuse's Relationship to Informatics.

This item is Non-Returnable

Details

  • ISBN-13: 9783319133492
  • ISBN-10: 3319133497
  • Publisher: Springer
  • Publish Date: December 2014
  • Dimensions: 9.21 x 6.14 x 1 inches
  • Shipping Weight: 1.52 pounds
  • Page Count: 473

Related Categories

You May Also Like...

    1

BAM Customer Reviews