2 papers
math.LO2005
The halting problem is decidable on a set of asymptotic probability one
Joel David Hamkins, Alexei Miasnikov
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptoti…
math.GR2005
Isomorphism problem for finitely generated fully residually free groups
Inna Bumagin, Olga Kharlampovich, Alexei Miasnikov
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has…