Classical Recursion Theory

افزودن به بوکمارک اشتراک گذاری 0 دیدگاه کاربران 5 (1)

The Theory of Functions and Sets of Natural Numbers, Vol. II

مشارکت: عنوان و توضیح کوتاه هر کتاب را ترجمه کنید این ترجمه بعد از تایید با نام شما در سایت نمایش داده خواهد شد.

ترجمه این کتاب مشاهده همه کتاب های ترجمه نشده

The Theory of Functions and Sets of Natural Numbers, Vol. II

Volume II of Classical Recursion Theory describes the universe from a local (bottom-up
or synthetical) point of view, and covers the whole spectrum, from the
recursive to the arithmetical sets.

The first half of the book provides a detailed picture of the computable
sets from the perspective of Theoretical Computer Science. Besides giving a
detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity
classes, ranging from small time and space bounds to the elementary functions,
with a particular attention to polynomial time and space computability. It also
deals with primitive recursive functions and larger classes, which are of
interest to the proof theorist.

The second half of the book starts with the classical theory of recursively
enumerable sets and degrees, which constitutes the core of Recursion or
Computability Theory. Unlike other texts, usually confined to the Turing
degrees, the book covers a variety of other strong reducibilities, studying
both their individual structures and their mutual relationships. The last
chapters extend the theory to limit sets and arithmetical sets. The volume
ends with the first textbook treatment of the enumeration degrees, which
admit a number of applications from algebra to the Lambda Calculus.

The book is a valuable source of information for anyone interested in
Complexity and Computability Theory. The student will appreciate the detailed
but informal account of a wide variety of basic topics, while the specialist
will find a wealth of material sketched in exercises and asides. A massive
bibliography of more than a thousand titles completes the treatment on the
historical side.

لغو

گزارش تخلف

مغایرت عنوان کتاب با توضیحات و تصویر جلد
عدم رعایت حقوق نشر طبق قوانین جمهوری اسلامی ایران
محتوای مستهجن
توهین به قومیتها و محتوای نژادپرستی
توهین به اقیلیتهای مذهبی
اهانت به مقامات سیاسی و مذهبی
اشاعه ی کودک آزاری
سایر موارد

بستن

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

1999

نویسنده

Piergiorgio Odifreddi

ناشر

North-Holland

شابک

9780444502056

20,000 تومان

خرید کتاب مطالعه نمونه درخواست ترجمه کتاب

خرید کتاب Classical Recursion Theory

Classical Recursion Theory

گزارش تخلف

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

1999

نویسنده

ناشر

شابک

کتاب های مرتبط

Recursion: complexity in cognition

Computational prospects of infinity. Part 2

Recursion

Aspects of Incompleteness

Recursion

Fundamentals of Generalized Recursion Theory

Recursive Analysis

Kompʹi︠u︡ternai︠a︡ lingvistika dli︠a︡ vsekh : mify, algoritmy, i︠a︡zyk

Calvin C. Elgot : selected papers

Complexity, Logic, and Recursion Theory

Techniques of Admissible Recursion Theory

Higher Recursion Theory

Recursion Theory Week

Potential Wadge Classes

Computable Analysis

Computability Theory

The Recursion Method

Recursive number theory a development of recursive arithmetic in a logic-free equation calculus.

Computability

Recursive Algebra, Analysis and Combinatorics

Recursive Model Theory

دیدگاه کاربران