↓ Skip to main content
What is this page? Embed badge

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 Algorithmic Randomness, Quantum Physics, and Incompleteness
  3. Altmetric Badge
    Chapter 2 On the Complexity of Universal Programs
  4. Altmetric Badge
    Chapter 3 Finite Sets of Words and Computing
  5. Altmetric Badge
    Chapter 4 Universality and Cellular Automata
  6. Altmetric Badge
    Chapter 5 Leaf Language Classes
  7. Altmetric Badge
    Chapter 6 Computational Completeness of P Systems with Active Membranes and Two Polarizations
  8. Altmetric Badge
    Chapter 7 Computing with a Distributed Reaction-Diffusion Model
  9. Altmetric Badge
    Chapter 8 Computational Universality in Symbolic Dynamical Systems
  10. Altmetric Badge
    Chapter 9 Real Recursive Functions and Real Extensions of Recursive Functions
  11. Altmetric Badge
    Chapter 10 Ordering and Convex Polyominoes
  12. Altmetric Badge
    Chapter 11 Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages
  13. Altmetric Badge
    Chapter 12 Evolution and Observation: A Non-standard Way to Accept Formal Languages
  14. Altmetric Badge
    Chapter 13 The Computational Power of Continuous Dynamic Systems
  15. Altmetric Badge
    Chapter 14 Abstract Geometrical Computation for Black Hole Computation
  16. Altmetric Badge
    Chapter 15 Is Bosco’s Rule Universal?
  17. Altmetric Badge
    Chapter 16 Sequential P Systems with Unit Rules and Energy Assigned to Membranes
  18. Altmetric Badge
    Chapter 17 Hierarchies of DLOGTIME-Uniform Circuits
  19. Altmetric Badge
    Chapter 18 Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays
  20. Altmetric Badge
    Chapter 19 Register Complexity of LOOP-, WHILE-, and GOTO-Programs
  21. Altmetric Badge
    Chapter 20 Classification and Universality of Reversible Logic Elements with One-Bit Memory
  22. Altmetric Badge
    Chapter 21 Universal Families of Reversible P Systems
  23. Altmetric Badge
    Chapter 22 Solving 3CNF-SAT and HPP in Linear Time Using WWW
  24. Altmetric Badge
    Chapter 23 Completing a Code in a Regular Submonoid of the Free Monoid
  25. Altmetric Badge
    Chapter 24 On Computational Universality in Language Equations
  26. Altmetric Badge
    Chapter 25 Attacking the Common Algorithmic Problem by Recognizer P Systems
  27. Altmetric Badge
    Chapter 26 On the Minimal Automaton of the Shuffle of Words and Araucarias
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
1 Wikipedia page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
6 Mendeley
Summary X Wikipedia Dimensions citations
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.
Title
Machines, Computations, and Universality
Published by
Springer, Berlin, Heidelberg, January 2004
DOI 10.1007/b106980
ISBNs
978-3-54-025261-0, 978-3-54-031834-7
Editors

Maurice Margenstern

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
 Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 17%
Unknown 5 83%
Readers by discipline Count As %
Computer Science 1 17%
Unknown 5 83%

This page is provided by Altmetric.