Algorithmic Randomness and Complexity pdf epub mobi txt 电子书下载 2025

简体网页||繁体网页

☆☆☆☆☆

出版者:

作者:Rodney G. Downey

出品人:

页数:884

译者:

出版时间:2010-11

价格:$ 111.87

装帧:

isbn号码:9780387955674

丛书系列:Theory and Applications of Computability

图书标签:

计算机科学
数理逻辑
数学
and
algorithmic_information_theory
Springer
Randomness
MathComputableComplexity
算法随机性
计算复杂性
信息论
可计算性理论
数理逻辑
随机性
复杂性
算法
理论计算机科学
Kolmogorov复杂性

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小美书屋

book.quotespace.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

具体描述

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.

作者简介

目录信息

Preface
Acknowledgments
Introduction
I. Background
Preliminaries
Computability Theory
Kolmogorov Complexity of Finite Strings
Relating Plain and Prefix-Free Complexity
Effective Reals
II. Randomness of Sets
Martin-Löf Randomness
Other Notions of Effective Randomness
Algorithmic Randomness and Turing Reducibility
III. Relative Randomness
Measures of Relative Randomness
The Quantity of K- and Other Degrees
Randomness-Theoretic Weakness
Lowness for Other Randomness Notions
Effective Hausdorff Dimension
IV. Further Topics
Omega as an Operator
Complexity of C.E. Sets
References
Index
· · · · · · (收起)