Our main result is the equivalence of two notions of reducibility betweenstructures. One is a syntactical notion which is an effective version ofinterpretability as in model theory, and the other one is a computational notionwhich is a strengthening of the well-known Medvedev reducibility. We extend ourresult to effective bi-interpretability and also to effective reductions betweenclasses of structures.