On Accessible Properties of Structure A(E)

摘要

In this paper, we went a further study about the structure of asymptotically dominating equivalence classes of algorithmically complexity functions. By using the ideal computer URM and the method of asymptotic analysis, we established the structure of asymptotically dominating equivalence classes of effective computable functions and proved in this structure that every uniformity unbounded equivalence class of effective computable functions has strongly inaccessible property.