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
· · · · · · (收起)