Recursion Theory and Computational Complexity Recursion Theory and Computational Complexity

Recursion Theory and Computational Complexity

Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979

G. Lolli
    • ‏34٫99 US$
    • ‏34٫99 US$

وصف الناشر

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.

النوع
علم وطبيعة
تاريخ النشر
٢٠١١
١٧ يونيو
اللغة
EN
الإنجليزية
عدد الصفحات
٢٣٦
الناشر
Springer Berlin Heidelberg
البائع
Springer Nature B.V.
الحجم
٧٫٧
‫م.ب.‬

المزيد من الكتب المشابهة

Aspects of Mathematical Logic Aspects of Mathematical Logic
Aspects of Mathematical Logic
٢٠١١
The Structure of the Real Line The Structure of the Real Line
The Structure of the Real Line
٢٠١١
Structure And Randomness In Computability And Set Theory Structure And Randomness In Computability And Set Theory
Structure And Randomness In Computability And Set Theory
٢٠٢٠
Modern Real Analysis Modern Real Analysis
Modern Real Analysis
٢٠١٧
Complexity, Logic, and Recursion Theory Complexity, Logic, and Recursion Theory
Complexity, Logic, and Recursion Theory
٢٠١٩
Foundations of Stochastic Analysis Foundations of Stochastic Analysis
Foundations of Stochastic Analysis
٢٠١٣