KI-Beratung Beta

  • Produktbild: Recursion Theory Week
  • Produktbild: Recursion Theory Week
Band 1432

Recursion Theory Week Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989

36,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

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...

Beschreibung

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.

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

24.07.1990

Abbildungen

VIII, 400 p.

Herausgeber Klaus Ambos-Spies + weitere

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

24.07.1990

Abbildungen

VIII, 400 p.

Herausgeber
Verlag Springer Berlin
Seitenzahl

400

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

616 g

Auflage

1990

Sprache

Englisch

ISBN

978-3-540-52772-5

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Recursion Theory Week
  • Produktbild: Recursion Theory Week
  • 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.