رسته‌ها
Computability and Randomness
امتیاز دهید
5 / 4.5
با 2 رای
نویسنده:
امتیاز دهید
5 / 4.5
با 2 رای
(Oxford Logic Guides)
The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the
intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory.
The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
Lorem ipsum dolor sit amet, consectetur adipiscing elit.
pirmardan
آپلود شده توسط: pirmardan
۱۳۹۹/۰۶/۲۰
اطلاعات نسخه الکترونیکی
تعداد صفحات:
450
فرمت:
PDF
درج دیدگاه مختص اعضا است! برای ورود به حساب خود اینجا و برای عضویت اینجا کلیک کنید.

دیدگاه‌های کتاب الکترونیکی Computability and Randomness

تعداد دیدگاه‌ها:
0
دیدگاهی درج نشده؛ شما نخستین نگارنده باشید.
افزودن نسخه جدید
انتخاب فایل
comment_comments_for_the_file