Computability Theory

Computability Theory pdf epub mobi txt 電子書 下載2025

出版者:American Mathematical Society
作者:Rebecca Weber
出品人:
頁數:203
译者:
出版時間:2012-5
價格:0
裝幀:Paperback
isbn號碼:9780821873922
叢書系列:Student Mathematical Library
圖書標籤:
  • MathLogic
  • Math
  • 計算理論
  • 可計算性
  • 圖靈機
  • 遞歸論
  • 形式語言
  • 算法
  • 復雜性理論
  • 邏輯學
  • 數學基礎
  • 理論計算機科學
想要找書就要到 小美書屋
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!

具體描述

What can we compute—even with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theory.

The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be self-contained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites.

著者簡介

Rebecca Weber: Dartmouth College, Hanover, NH

圖書目錄

Cover 1
Title page 4
Contents 6
Introduction 10
Background 18
Defining computability 50
Working with computable functions 86
Computing and enumerating sets 104
Turing reduction and Post’s problem 118
Two hierarchies of sets 136
Further tools and results 148
Areas of research 158
Mathematical asides 198
Bibliography 202
Index 208
Back Cover 218
· · · · · · (收起)

讀後感

評分

評分

評分

評分

評分

用戶評價

评分

習題不算很難,但問題是有些應該解釋的細節沒說清楚,作為入門書的話有個教授能問問最好。computability是個很神奇的領域,個人覺得

评分

習題不算很難,但問題是有些應該解釋的細節沒說清楚,作為入門書的話有個教授能問問最好。computability是個很神奇的領域,個人覺得

评分

習題不算很難,但問題是有些應該解釋的細節沒說清楚,作為入門書的話有個教授能問問最好。computability是個很神奇的領域,個人覺得

评分

習題不算很難,但問題是有些應該解釋的細節沒說清楚,作為入門書的話有個教授能問問最好。computability是個很神奇的領域,個人覺得

评分

習題不算很難,但問題是有些應該解釋的細節沒說清楚,作為入門書的話有個教授能問問最好。computability是個很神奇的領域,個人覺得

本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度google,bing,sogou

© 2025 book.quotespace.org All Rights Reserved. 小美書屋 版权所有