Recursion Theory Week
Springer Berlin (Verlag)
978-3-540-52772-5 (ISBN)
Honest polynomial reductions and exptally sets.- On the structure of degrees below O?.- Positive solutions to Post's problem.- The metamathematics of Fraïssé's order type conjecture.- Enumeration reducibility, nondeterministic computations and relative computability of partial functions.- Notes on the O? priority method with special attention to density results.- Array nonrecursive sets and multiple permitting arguments.- Superbranching degrees.- A direct construction of a minimal recursively enumerable truth-table degree.- ?2-induction and the construction of a high degree.- Undecidability and initial segments of the wtt-degrees ?0?.- Randomness and generalizations of fixed point free functions.- Recursive enumeration without repetition revisited.- Priority arguments using iterated trees of strategies.- On the relationship between the complexity, the degree, and the extension of a computable set.- Polynomially isolated sets.- A characterization of effective topological spaces.
Erscheint lt. Verlag | 24.7.1990 |
---|---|
Reihe/Serie | Lecture Notes in Mathematics |
Zusatzinfo | VIII, 400 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 572 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
Schlagworte | Complexity • Complexity theory • Computability • Computability Theory • Proof • turing degree |
ISBN-10 | 3-540-52772-9 / 3540527729 |
ISBN-13 | 978-3-540-52772-5 / 9783540527725 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich