This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and related techniques play a crucial role in understanding complexity of finite and infinite computations. We try not only to present the corresponding notions and facts from the particular fields but also to identify the unifying notions, techniques and ideas. © 2008 Elsevier B.V. All rights reserved.