Cantitate/Preț
Produs

Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989: Lecture Notes in Mathematics, cartea 1432

Editat de Klaus Ambos-Spies, Gert H. Müller, Gerald E. Sacks
en Limba Engleză Paperback – 24 iul 1990
These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
Citește tot Restrânge

Din seria Lecture Notes in Mathematics

Preț: 32223 lei

Nou

Puncte Express: 483

Preț estimativ în valută:
6167 6505$ 5154£

Carte tipărită la comandă

Livrare economică 31 decembrie 24 - 14 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540527725
ISBN-10: 3540527729
Pagini: 408
Ilustrații: VIII, 400 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Mathematics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.