Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular,  prove that the factorization problem is $\Sigma^0_3$-complete and the conjugacy problem $\Sigma^0_1$-complete in the arithmetical hierarchy.
['Jeandel Emmanuel', 'Pascal Vanier']
I am writing a research paper on a idea Hardness of conjugacy and factorization of multidimensional subshifts of finite type
[{"from": "human", "value": "I am writing a research paper on a idea Hardness of conjugacy and factorization of multidimensional subshifts of finite type"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular,  prove that the factorization problem is $\\Sigma^0_3$-complete and the conjugacy problem $\\Sigma^0_1$-complete in the arithmetical hierarchy."}]