Recursion Theory and Complexity

Priority method in generalized computability, I.V. Ashaev; polynomial time versus computable Boolean algebras, D. Cenzer, J.B. Remmel; the proof-theoretic strength of the Dushnik-Miller theorem, R.G. Downey, S. Lempp; effectively nowhere simple relations on computable models, V. Harizanov; jump traces with large gaps, P.G. Hinman; weak recursive degrees and a problem of Spector, Sh.T. Ishmukhametov; compositions of permutations and algorithmic reducibilities, K.V. Korovin; some properties of majorant-computability, M.V. Korovina, O.V. Kudinov; hyperarithmetical functions and algebraicity, A.C. Morozov; weak presentation of fields, not extendible to recursion presentations, A. Shlapentokh; jumps of Sigma 0/2-high e-degrees and properly Sigma0/2 e-degrees, R.A. Shore, A. Sorbi; the e-reducibility and problem of the nontotal property of e-degrees, B.Ja. Solon; algebras of recursive functions, V.D. Solo'vev; Sigma2-induction and cuppable degrees, Yang Yue. Open problems from Kazan '97 workshop. List of WORCT'97 participants, recursion theory. List of talks.