图书介绍

COMPUTABILITY AN INTRODUCTION TO RECURSIVE FUNCTION THEORY【2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载】

COMPUTABILITY AN INTRODUCTION TO RECURSIVE FUNCTION THEORY
  • 著
  • 出版社： CAMBRIDGE UNIVERSITY PRESS
  • ISBN：0521294657
  • 出版时间：1980
  • 标注页数：251页
  • 文件大小：44MB
  • 文件页数：262页
  • 主题词：

PDF下载


点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快]温馨提示：（请使用BT下载软件FDM进行下载）软件下载地址页直链下载[便捷但速度慢]  [在线试读本书]   [在线获取解压码]
点击复制MD5值：7fc5a643c3bcc77f21b03e246b2f1f2a

下载说明

COMPUTABILITY AN INTRODUCTION TO RECURSIVE FUNCTION THEORYPDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

点击复制85GB完整离线版磁力链接到迅雷FDM等BT下载工具进行下载  详情点击-查看共享计划
建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！

（文件页数 要大于 标注页数，上中下等多册电子书除外）

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

图书目录

Prologue.Prerequisites and notation1

1 Sets1

2 Functions2

3 Relations and predicates4

4 Logical notation4

5 References5

1 Computable functions7

1 Algorithms，or effective procedures7

2 The unlimited register machine9

3 URM-computable functions16

4 Decidable predicates and problems22

5 Computability on other domains23

2 Generating computable functions25

1 The basic functions25

2 Joining programs together25

3 Substitution29

4 Recursion32

5 Minimalisation42

3 Other approaches to computability：Church’s thesis48

1 Other approaches to computability48

2 Partial recursive functions（Godel-Kleene）49

3 A digression：the primitive recursive functions51

4 Turing-computability52

5 Symbol manipulation systems of Post and Markov57

6 Computability on domains other than N65

7 Church’s thesis67

4 Numbering computable functions72

1 Numbering programs72

2 Numbering computable functions76

3 Discussion：the diagonal method79

4 The s-m-n theorem81

5 Universal programs85

1 Universal functions and universal programs85

2 Two applications of the universal program90

3 Effective operations on computable functions93

Appendix.Computability of the function σn95

6 Decidability，undecidability and partial decidability100

1 Undecidable problems in computability101

2 The word problem for groups106

3 Diophantine equations107

4 Sturm’s algorithm108

5 Mathematical logic109

6 Partially decidable predicates112

7 Recursive and recursively enumerable sets121

1 Recursive sets121

2 Recursively enumerable sets123

3 Productive and creative sets133

4 Simple sets140

8 Arithmetic and Godel’s incompleteness theorem143

1 Formal arithmetic143

2 Incompleteness146

3 Godel’s incompleteness theorem149

4 Undecidability155

9 Reducibility and degrees157

1 Many-one reducibility158

2 Degrees161

3 m-complete r.e.sets165

4 Relative computability167

5 Turing reducibility and Turing degrees174

10 Effective operations on partial functions182

1 The second Recursion theorem182

2 Effective operations on computable functions189

3 The first Recursion theorem192

4 An application to the semantics of programming languages196

11 The second Recursion theorem200

1 The second Recursion theorem200

2 Discussion207

3 Myhill’s theorem210

12 Complexity of computation212

1 Complexity and complexity measures213

2 The Speed-up theorem218

3 Complexity classes223

4 The elementary functions225

13 Further study236

Bibliography239

Index of notation241

Subject Index246

热门推荐