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

    • 34,99 $
    • 34,99 $

От издателя

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.

ЖАНР
Наука и природа
РЕЛИЗ
2011
17 июня
ЯЗЫК
EN
английский
ОБЪЕМ
236
стр.
ИЗДАТЕЛЬ
Springer Berlin Heidelberg
ПРОДАВЕЦ
Springer Nature B.V.
РАЗМЕР
7,7
МБ
Aspects of Mathematical Logic Aspects of Mathematical Logic
2011
The Structure of the Real Line The Structure of the Real Line
2011
Structure And Randomness In Computability And Set Theory Structure And Randomness In Computability And Set Theory
2020
Modern Real Analysis Modern Real Analysis
2017
Complexity, Logic, and Recursion Theory Complexity, Logic, and Recursion Theory
2019
Foundations of Stochastic Analysis Foundations of Stochastic Analysis
2013