Computing with New Resources

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Counting with Probabilistic and Ultrametric Finite Automata
3. Altmetric Badge
   Chapter 2 Systolic Automata and P Systems
4. Altmetric Badge
   Chapter 3 Soliton Automata with Multiple Waves
5. Altmetric Badge
   Chapter 4 On Power Series over a Graded Monoid
6. Altmetric Badge
   Chapter 5 Advances on Random Sequence Generation by Uniform Cellular Automata
7. Altmetric Badge
   Chapter 6 On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages
8. Altmetric Badge
   Chapter 7 Aspects of Reversibility for Classical Automata
9. Altmetric Badge
   Chapter 8 A Weakly Universal Cellular Automaton in the Pentagrid with Five States
10. Altmetric Badge
    Chapter 9 Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
11. Altmetric Badge
    Chapter 10 Time-Optimum Smaller-State Synchronizers for Cellular Automata
12. Altmetric Badge
    Chapter 11 Computing Boolean Functions via Quantum Hashing
13. Altmetric Badge
    Chapter 12 Complexity of Promise Problems on Classical and Quantum Automata
14. Altmetric Badge
    Chapter 13 Quantum Complexity of Boolean Matrix Multiplication and Related Problems
15. Altmetric Badge
    Chapter 14 Quantum Distributed Computing Applied to Grover’s Search Algorithm
16. Altmetric Badge
    Chapter 15 Maximally Entangled State in Pseudo-Telepathy Games
17. Altmetric Badge
    Chapter 16 Quantum Finite Automata: A Modern Introduction
18. Altmetric Badge
    Chapter 17 Physical Aspects of Oracles for Randomness and Hadamard’s Conjecture
19. Altmetric Badge
    Chapter 18 From Quantum Query Complexity to State Complexity
20. Altmetric Badge
    Chapter 19 Small Universal Devices
21. Altmetric Badge
    Chapter 20 A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey
22. Altmetric Badge
    Chapter 21 Integral Difference Ratio Functions on Integers
23. Altmetric Badge
    Chapter 22 Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources
24. Altmetric Badge
    Chapter 23 Symmetries and Dualities in Name-Passing Process Calculi
25. Altmetric Badge
    Chapter 24 Learning from Positive Data and Negative Counterexamples: A Survey
26. Altmetric Badge
    Chapter 25 One-Sided Random Context Grammars: A Survey
27. Altmetric Badge
    Chapter 26 How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?
28. Altmetric Badge
    Chapter 27 On Evolutionary Approximation of Logic Circuits
29. Altmetric Badge
    Chapter 28 A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
30. Altmetric Badge
    Chapter 29 On the Limit of Some Algorithmic Approach to Circuit Lower Bounds
31. Altmetric Badge
    Chapter 30 P Systems with Anti-Matter
32. Altmetric Badge
    Chapter 31 A Robust Universal Flying Amorphous Computer
33. Altmetric Badge
    Chapter 32 Minimal Reaction Systems Defining Subset Functions
34. Altmetric Badge
    Chapter 33 Grand Challenges of Informatics
35. Altmetric Badge
    Chapter 34 Konrad Zuse’s Relationship to Informatics