The virtually-free characterization by computable SFT degrees
Statement
Let be a finitely generated group, let a -SFT be a subshift of finite type over , and let denote the computable Medvedev degree. Virtually-free SFT-degree conjecture. The group is virtually free if and only if every nonempty -SFT has Medvedev degree
The conjecture would characterize virtually free groups through the computability of all nonempty SFTs. The source notes that it implies conjectures about weakly aperiodic SFTs and about decidability of the domino problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.