Every effective dynamical system on a recursively presented finitely generated group has a computable zero-dimensional Cantor extension, which extends simulation results to non-symbolic systems and yields new Medvedev degree classifications.
Orbit Decidability and the Conju- gacy Problem for Some Extensions of Groups
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Subshifts on groups and computable analysis
Every effective dynamical system on a recursively presented finitely generated group has a computable zero-dimensional Cantor extension, which extends simulation results to non-symbolic systems and yields new Medvedev degree classifications.