Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Juli 1990
Genre:	Schulbücher
	complexity / complexitytheory / Computability / Computabilitytheory / Proof / turingdegree
ISBN:	9783540527725
EAN-Code:	9783540527725
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 23 mm
Gewicht:	616 gr
Seiten:	408
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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. TOC:From the Contents: S.B. Cooper: Enumeration reducibility, nondeterministic computations and relative computability of partial functions.- R. Downey, C. Jockusch, M. Stob: Array nonrecursive sets and multiple permitting arguments.- C.A. Haught, R.A. Shore: Undecidability and initial segments of the wtt-degrees l 0'.- S. Lempp, M. Lerman: Priority arguments using iterated trees of strategies.- W. Maass, T.A. Slaman: On the relation ship between the complexity, the degree, and the extension of a computable set.- A. Nerode, J.B. Remmel: Polynomially isolated sets.