Atjaunināt sīkdatņu piekrišanu

Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989 1990 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 400 pages, height x width: 235x155 mm, weight: 1260 g, VIII, 400 p., 1 Paperback / softback
  • Sērija : Lecture Notes in Mathematics 1432
  • Izdošanas datums: 24-Jul-1990
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540527729
  • ISBN-13: 9783540527725
  • Mīkstie vāki
  • Cena: 33,48 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 39,40 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 400 pages, height x width: 235x155 mm, weight: 1260 g, VIII, 400 p., 1 Paperback / softback
  • Sērija : Lecture Notes in Mathematics 1432
  • Izdošanas datums: 24-Jul-1990
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540527729
  • ISBN-13: 9783540527725
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.

Papildus informācija

Springer Book Archives
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.