On the public citation graph

The Group of Reversible Turing Machines: Subgroups, Generators and Computability

https://doi.org/10.2139/ssrn.4536620
0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-18812-6openalex-extracted
Cellular Automata and Discrete Complex Systems
inferredcites →https://doi.org/10.1007/978-3-319-18812-6_11openalex-extracted
Plane-Walking Automata
inferredcites →https://doi.org/10.1007/978-3-319-39300-1_5openalex-extracted
The Group of Reversible Turing Machines
inferredcites →https://doi.org/10.1007/978-3-540-85238-4_34openalex-extracted
Periodicity and Immortality in Reversible Computing
inferredcites →https://doi.org/10.1007/978-3-642-13182-0_11openalex-extracted
Zigzags in Turing Machines
inferredcites →https://doi.org/10.1007/978-3-642-14034-1_1openalex-extracted
Cellular Automata
inferredcites →https://doi.org/10.1007/978-3-642-15025-8_12openalex-extracted
Effective Closed Subshifts in 1D Can Be Implemented in 2D
inferredcites →https://doi.org/10.1007/978-3-662-48057-1_18openalex-extracted
The Transitivity Problem of Turing Machines
inferredcites →https://doi.org/10.1007/bf01201813openalex-extracted
Representation of Reversible Cellular Automata with Block Permutations
inferredcites →https://doi.org/10.1007/bf02810689openalex-extracted
Full groups of Cantor minimal systems
inferredcites →https://doi.org/10.1007/s00222-008-0161-7openalex-extracted
On the dynamics and recursive properties of multidimensional symbolic systems
inferredcites →https://doi.org/10.1007/s002240000005openalex-extracted
inferredcites →https://doi.org/10.1007/s10440-013-9808-5openalex-extracted
Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type
inferredcites →https://doi.org/10.1016/0167-2789(86)90237-xopenalex-extracted
Studying artificial life with cellular automata
inferredcites →https://doi.org/10.1016/j.tcs.2006.10.004openalex-extracted
One Head Machines from a symbolic approach
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.052openalex-extracted
A tight linear bound on the synchronization delay of bijective automata
inferredcites →https://doi.org/10.1016/j.tcs.2010.04.033openalex-extracted
Erratum to: Entropy of Turing machines with moving head
inferredcites →https://doi.org/10.1016/j.tcs.2016.11.033openalex-extracted
A notion of effectiveness for subshifts on finitely generated groups
inferredcites →https://doi.org/10.1016/s0304-3975(01)00382-6openalex-extracted
On the presence of periodic configurations in Turing machines and in counter machines
inferredcites →https://doi.org/10.1016/s0304-3975(96)00025-4openalex-extracted
On topological dynamics of Turing machines
inferredcites →https://doi.org/10.1070/sm2014v205n06abeh004400openalex-extracted
On algebraic properties of topological full groups
inferredcites →https://doi.org/10.1088/0951-7715/4/2/002openalex-extracted
Generalized shifts: unpredictability and undecidability in dynamical systems
inferredcites →https://doi.org/10.1090/s0002-9939-2013-11654-0openalex-extracted
On the topological full group of a minimal Cantor 𝐙²-system
inferredcites →https://doi.org/10.1090/tran/6963openalex-extracted
Some undecidability results for asynchronous transducers and the Brin-Thompson group 2𝑉
inferredcites →https://doi.org/10.1142/s0129167x06003448openalex-extracted
SOME REMARKS ON TOPOLOGICAL FULL GROUPS OF CANTOR MINIMAL SYSTEMS
inferredcites →https://doi.org/10.1515/crelle-2013-0041openalex-extracted
Topological full groups of one-sided shifts of finite type
inferredcites →https://doi.org/10.3233/fun-2008-843-406openalex-extracted
The Chain Relation in Sofic Subshifts
inferredcites →https://doi.org/10.4007/annals.2013.178.2.7openalex-extracted
Cantor systems, piecewise translations and simple amenable groups
inferredcites →https://doi.org/10.4064/sm190212-18-10openalex-extracted
Subshifts with sparse traces
inferredcites →https://doi.org/10.4230/lipics.stacs.2014.421openalex-extracted
Computability of the entropy of one-tape Turing Machines
inferredcites →https://doi.org/10.48550/arxiv.1210.5800openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.1506.03777openalex-extracted
Reversible Logic Synthesis with Minimal Usage of Ancilla Bits
inferredcites →https://doi.org/10.48550/arxiv.cs/0404021openalex-extracted
Decidability and Universality in Symbolic Dynamical Systems
inferredcites →https://doi.org/10.1007/978-3-319-40578-0_18openalex-snapshot
Strongly Universal Reversible Gate Sets
inferredcites →https://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.