↓ Skip to main content

Machines, Computations, and Universality

Overview of attention for book
Cover of 'Machines, Computations, and Universality'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Encapsulating Reaction-Diffusion Computers
  3. Altmetric Badge
    Chapter 2 On the Computational Capabilities of Several Models
  4. Altmetric Badge
    Chapter 3 Universality, Reducibility, and Completeness
  5. Altmetric Badge
    Chapter 4 Using Approximation to Relate Computational Classes over the Reals
  6. Altmetric Badge
    Chapter 5 A Survey of Infinite Time Turing Machines
  7. Altmetric Badge
    Chapter 6 The Tiling Problem Revisited (Extended Abstract)
  8. Altmetric Badge
    Chapter 7 Decision Versus Evaluation in Algebraic Complexity
  9. Altmetric Badge
    Chapter 8 A Universal Reversible Turing Machine
  10. Altmetric Badge
    Chapter 9 P Systems and Picture Languages
  11. Altmetric Badge
    Chapter 10 Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
  12. Altmetric Badge
    Chapter 11 Uniform Solution of QSAT Using Polarizationless Active Membranes
  13. Altmetric Badge
    Chapter 12 Satisfiability Parsimoniously Reduces to the Tantrix TM Rotation Puzzle Problem
  14. Altmetric Badge
    Chapter 13 Planar Trivalent Network Computation
  15. Altmetric Badge
    Chapter 14 On the Power of Networks of Evolutionary Processors
  16. Altmetric Badge
    Chapter 15 Study of Limits of Solvability in Tag Systems
  17. Altmetric Badge
    Chapter 16 Query Completeness of Skolem Machine Computations
  18. Altmetric Badge
    Chapter 17 More on the Size of Higman-Haines Sets: Effective Constructions
  19. Altmetric Badge
    Chapter 18 Insertion-Deletion Systems with One-Sided Contexts
  20. Altmetric Badge
    Chapter 19 Accepting Networks of Splicing Processors with Filtered Connections
  21. Altmetric Badge
    Chapter 20 Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
  22. Altmetric Badge
    Chapter 21 Four Small Universal Turing Machines
  23. Altmetric Badge
    Chapter 22 Changing the Neighborhood of Cellular Automata
  24. Altmetric Badge
    Chapter 23 A Simple P-Complete Problem and Its Representations by Language Equations
  25. Altmetric Badge
    Chapter 24 Slightly Beyond Turing’s Computability for Studying Genetic Programming
  26. Altmetric Badge
    Chapter 25 A Smallest Five-State Solution to the Firing Squad Synchronization Problem
  27. Altmetric Badge
    Chapter 26 Small Semi-weakly Universal Turing Machines
  28. Altmetric Badge
    Chapter 27 Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4 n -Steps Solution
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

1 blog
3 tweeters
1 Wikipedia page

Readers on

5 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Machines, Computations, and Universality
Published by
Springer Berlin Heidelberg, August 2007
DOI 10.1007/978-3-540-74593-8
978-3-54-074592-1, 978-3-54-074593-8

Durand-Lose, Jérôme, Margenstern, Maurice

Twitter Demographics

The data shown below were collected from the profiles of 3 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Spain 2 40%
Unknown 3 60%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 60%
Student > Master 1 20%
Professor > Associate Professor 1 20%
Unspecified 1 20%
Readers by discipline Count As %
Computer Science 5 100%
Unspecified 1 20%