Abstract:
We demonstrate that the question whether or not a given topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.
Key words and phrases:Thurston equivalence, branched covering, algorithmic decidability.