Polish
Machines, Computations, and Universality
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Decidability Problems for Self-induced Systems Generated by a Substitution
-
Altmetric BadgeChapter 2 Towards Formal Verification of Computations and Hypercomputations in Relativistic Physics
-
Altmetric BadgeChapter 3 A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems
-
Altmetric BadgeChapter 4 Tight Bounds for Cut-Operations on Deterministic Finite Automata
-
Altmetric BadgeChapter 5 Non-isometric Contextual Array Grammars with Regular Control and Local Selectors
-
Altmetric BadgeChapter 6 Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States
-
Altmetric BadgeChapter 7 Tinput-Driven Pushdown Automata
-
Altmetric BadgeChapter 8 Reversible Limited Automata
-
Altmetric BadgeChapter 9 An Intrinsically Universal Family of Causal Graph Dynamics
-
Altmetric BadgeChapter 10 The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
-
Altmetric BadgeChapter 11 A Characterization of NP Within Interval-Valued Computing
-
Altmetric BadgeChapter 12 Universality in Infinite Petri Nets
Attention for Chapter 2:
Towards Formal Verification of Computations and Hypercomputations in Relativistic Physics
Altmetric Badge
About this Attention Score
-
Above-average Attention Score compared to outputs of the same age (57th percentile)
-
Good Attention Score compared to outputs of the same age and source (76th percentile)
Citations
- dimensions_citation
- 2 Dimensions
Readers on
- mendeley
- 1 Mendeley